./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a5e3c5868bad164e21cd0fc02186c2fb27c3de8083d1633d4818509bd4b4b8d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:51:10,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:51:10,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:51:10,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:51:10,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:51:10,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:51:10,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:51:10,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:51:10,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:51:10,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:51:10,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:51:10,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:51:10,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:51:10,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:51:10,677 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:51:10,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:51:10,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:51:10,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:51:10,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:51:10,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:51:10,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:51:10,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:51:10,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:51:10,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:51:10,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:51:10,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:51:10,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:51:10,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:51:10,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:51:10,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:51:10,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:51:10,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:51:10,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:51:10,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:51:10,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:51:10,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:51:10,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:51:10,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:51:10,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:51:10,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:51:10,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:51:10,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:51:10,683 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a5e3c5868bad164e21cd0fc02186c2fb27c3de8083d1633d4818509bd4b4b8d [2024-10-24 06:51:10,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:51:10,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:51:10,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:51:10,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:51:10,947 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:51:10,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2024-10-24 06:51:12,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:51:12,416 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:51:12,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2024-10-24 06:51:12,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917b81c8b/75adbef636af449184b8090a5bf5cb14/FLAG998598422 [2024-10-24 06:51:12,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917b81c8b/75adbef636af449184b8090a5bf5cb14 [2024-10-24 06:51:12,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:51:12,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:51:12,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:51:12,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:51:12,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:51:12,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:51:12" (1/1) ... [2024-10-24 06:51:12,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa4c69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12, skipping insertion in model container [2024-10-24 06:51:12,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:51:12" (1/1) ... [2024-10-24 06:51:12,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:51:12,646 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i[919,932] [2024-10-24 06:51:12,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:51:12,730 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:51:12,740 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i[919,932] [2024-10-24 06:51:12,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:51:12,795 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:51:12,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12 WrapperNode [2024-10-24 06:51:12,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:51:12,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:51:12,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:51:12,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:51:12,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12" (1/1) ... [2024-10-24 06:51:12,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12" (1/1) ... [2024-10-24 06:51:12,838 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-10-24 06:51:12,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:51:12,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:51:12,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:51:12,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:51:12,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12" (1/1) ... [2024-10-24 06:51:12,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12" (1/1) ... [2024-10-24 06:51:12,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12" (1/1) ... [2024-10-24 06:51:12,868 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:51:12,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12" (1/1) ... [2024-10-24 06:51:12,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12" (1/1) ... [2024-10-24 06:51:12,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12" (1/1) ... [2024-10-24 06:51:12,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12" (1/1) ... [2024-10-24 06:51:12,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12" (1/1) ... [2024-10-24 06:51:12,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12" (1/1) ... [2024-10-24 06:51:12,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:51:12,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:51:12,894 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:51:12,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:51:12,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12" (1/1) ... [2024-10-24 06:51:12,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:51:12,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:51:12,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:51:12,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:51:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:51:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:51:12,970 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:51:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:51:12,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:51:12,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:51:13,043 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:51:13,044 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:51:13,337 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-24 06:51:13,338 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:51:13,385 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:51:13,385 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:51:13,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:51:13 BoogieIcfgContainer [2024-10-24 06:51:13,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:51:13,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:51:13,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:51:13,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:51:13,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:51:12" (1/3) ... [2024-10-24 06:51:13,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdee54f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:51:13, skipping insertion in model container [2024-10-24 06:51:13,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:12" (2/3) ... [2024-10-24 06:51:13,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdee54f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:51:13, skipping insertion in model container [2024-10-24 06:51:13,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:51:13" (3/3) ... [2024-10-24 06:51:13,395 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2024-10-24 06:51:13,409 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:51:13,409 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:51:13,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:51:13,468 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@34005f0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:51:13,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:51:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 57 states have internal predecessors, (87), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:51:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 06:51:13,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:13,491 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:13,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:13,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash -177386306, now seen corresponding path program 1 times [2024-10-24 06:51:13,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434490220] [2024-10-24 06:51:13,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:13,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:13,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:51:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:51:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:51:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:51:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:51:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:51:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:51:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:51:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:51:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:51:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:51:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:51:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:51:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:51:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:51:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:51:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:51:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:51:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:51:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:51:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:51:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:51:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:51:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:51:14,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:14,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434490220] [2024-10-24 06:51:14,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434490220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:14,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:14,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:51:14,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333411221] [2024-10-24 06:51:14,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:14,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:51:14,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:14,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:51:14,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:51:14,175 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 57 states have internal predecessors, (87), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:51:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:14,279 INFO L93 Difference]: Finished difference Result 240 states and 443 transitions. [2024-10-24 06:51:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:51:14,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-10-24 06:51:14,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:14,300 INFO L225 Difference]: With dead ends: 240 [2024-10-24 06:51:14,300 INFO L226 Difference]: Without dead ends: 158 [2024-10-24 06:51:14,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:51:14,307 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 112 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:14,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 316 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:51:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-24 06:51:14,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 97. [2024-10-24 06:51:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 71 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:51:14,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 155 transitions. [2024-10-24 06:51:14,364 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 155 transitions. Word has length 153 [2024-10-24 06:51:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:14,368 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 155 transitions. [2024-10-24 06:51:14,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:51:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 155 transitions. [2024-10-24 06:51:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 06:51:14,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:14,377 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:14,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:51:14,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:14,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:14,378 INFO L85 PathProgramCache]: Analyzing trace with hash -120128004, now seen corresponding path program 1 times [2024-10-24 06:51:14,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:14,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275294983] [2024-10-24 06:51:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:14,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:51:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:51:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:51:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:51:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:51:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:51:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:51:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:51:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:51:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:51:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:51:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:51:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:51:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:51:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:51:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:51:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:51:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:51:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:51:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:51:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:51:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:51:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:51:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:51:14,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:14,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275294983] [2024-10-24 06:51:14,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275294983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:14,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:14,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:51:14,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481090204] [2024-10-24 06:51:14,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:14,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:51:14,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:14,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:51:14,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:51:14,779 INFO L87 Difference]: Start difference. First operand 97 states and 155 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:51:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:14,988 INFO L93 Difference]: Finished difference Result 261 states and 416 transitions. [2024-10-24 06:51:14,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:51:14,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-10-24 06:51:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:14,992 INFO L225 Difference]: With dead ends: 261 [2024-10-24 06:51:14,992 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 06:51:14,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:14,996 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 71 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:14,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 377 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:51:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 06:51:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2024-10-24 06:51:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 127 states have (on average 1.5275590551181102) internal successors, (194), 128 states have internal predecessors, (194), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 06:51:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2024-10-24 06:51:15,019 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 258 transitions. Word has length 153 [2024-10-24 06:51:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:15,020 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 258 transitions. [2024-10-24 06:51:15,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:51:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 258 transitions. [2024-10-24 06:51:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-24 06:51:15,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:15,027 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:15,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:51:15,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:15,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:15,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1550046021, now seen corresponding path program 1 times [2024-10-24 06:51:15,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:15,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268652586] [2024-10-24 06:51:15,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:15,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:51:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:51:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:51:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:51:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:51:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:51:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:51:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:51:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:51:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:51:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:51:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:51:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:51:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:51:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:51:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:51:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:51:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:51:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:51:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:51:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:51:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:51:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:51:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 06:51:15,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:15,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268652586] [2024-10-24 06:51:15,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268652586] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:51:15,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612620553] [2024-10-24 06:51:15,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:15,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:51:15,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:51:15,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:51:15,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 06:51:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:15,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 06:51:15,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:51:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 465 proven. 18 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-10-24 06:51:16,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:51:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 51 proven. 18 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 06:51:16,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612620553] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:51:16,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:51:16,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 18 [2024-10-24 06:51:16,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344377415] [2024-10-24 06:51:16,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:51:16,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 06:51:16,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:16,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 06:51:16,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-10-24 06:51:16,811 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. Second operand has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-10-24 06:51:18,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:18,798 INFO L93 Difference]: Finished difference Result 698 states and 1030 transitions. [2024-10-24 06:51:18,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-24 06:51:18,799 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) Word has length 154 [2024-10-24 06:51:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:18,807 INFO L225 Difference]: With dead ends: 698 [2024-10-24 06:51:18,808 INFO L226 Difference]: Without dead ends: 537 [2024-10-24 06:51:18,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1893 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1165, Invalid=4687, Unknown=0, NotChecked=0, Total=5852 [2024-10-24 06:51:18,815 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 715 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:18,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 646 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 06:51:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-10-24 06:51:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 271. [2024-10-24 06:51:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 193 states have (on average 1.3471502590673574) internal successors, (260), 195 states have internal predecessors, (260), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 06:51:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 388 transitions. [2024-10-24 06:51:18,886 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 388 transitions. Word has length 154 [2024-10-24 06:51:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:18,886 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 388 transitions. [2024-10-24 06:51:18,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-10-24 06:51:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 388 transitions. [2024-10-24 06:51:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 06:51:18,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:18,889 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:18,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 06:51:19,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:51:19,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:19,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash -991853403, now seen corresponding path program 1 times [2024-10-24 06:51:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:19,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997429478] [2024-10-24 06:51:19,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:19,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:51:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:51:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:51:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:51:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:51:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:51:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:51:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:51:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:51:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:51:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:51:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:51:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:51:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:51:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:51:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:51:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:51:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:51:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:51:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:51:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:51:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:51:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:51:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:51:19,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:19,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997429478] [2024-10-24 06:51:19,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997429478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:19,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:19,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:51:19,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342452424] [2024-10-24 06:51:19,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:19,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:51:19,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:19,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:51:19,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:19,484 INFO L87 Difference]: Start difference. First operand 271 states and 388 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:51:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:19,647 INFO L93 Difference]: Finished difference Result 563 states and 810 transitions. [2024-10-24 06:51:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:51:19,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2024-10-24 06:51:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:19,651 INFO L225 Difference]: With dead ends: 563 [2024-10-24 06:51:19,651 INFO L226 Difference]: Without dead ends: 420 [2024-10-24 06:51:19,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:51:19,653 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 85 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:19,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 426 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:51:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-24 06:51:19,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 330. [2024-10-24 06:51:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 223 states have (on average 1.3004484304932735) internal successors, (290), 225 states have internal predecessors, (290), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-24 06:51:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 466 transitions. [2024-10-24 06:51:19,689 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 466 transitions. Word has length 156 [2024-10-24 06:51:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:19,690 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 466 transitions. [2024-10-24 06:51:19,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:51:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 466 transitions. [2024-10-24 06:51:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 06:51:19,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:19,692 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:19,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:51:19,692 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:19,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:19,693 INFO L85 PathProgramCache]: Analyzing trace with hash 589933554, now seen corresponding path program 1 times [2024-10-24 06:51:19,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:19,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954233675] [2024-10-24 06:51:19,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:19,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:51:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:51:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:51:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:51:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:51:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:51:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:51:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:51:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:51:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:51:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:51:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:51:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:51:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:51:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:51:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:51:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:51:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:51:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:51:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:51:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:51:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:51:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:51:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 63 proven. 69 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-10-24 06:51:20,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:20,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954233675] [2024-10-24 06:51:20,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954233675] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:51:20,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894585402] [2024-10-24 06:51:20,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:20,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:51:20,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:51:20,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:51:20,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 06:51:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 06:51:20,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:51:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 726 proven. 69 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-24 06:51:20,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:51:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-24 06:51:21,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894585402] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:51:21,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:51:21,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 26 [2024-10-24 06:51:21,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772549237] [2024-10-24 06:51:21,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:51:21,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 06:51:21,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:21,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 06:51:21,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2024-10-24 06:51:21,485 INFO L87 Difference]: Start difference. First operand 330 states and 466 transitions. Second operand has 26 states, 25 states have (on average 4.84) internal successors, (121), 26 states have internal predecessors, (121), 10 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 9 states have call predecessors, (72), 10 states have call successors, (72) [2024-10-24 06:51:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:23,068 INFO L93 Difference]: Finished difference Result 783 states and 1077 transitions. [2024-10-24 06:51:23,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-24 06:51:23,069 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.84) internal successors, (121), 26 states have internal predecessors, (121), 10 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 9 states have call predecessors, (72), 10 states have call successors, (72) Word has length 156 [2024-10-24 06:51:23,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:23,072 INFO L225 Difference]: With dead ends: 783 [2024-10-24 06:51:23,073 INFO L226 Difference]: Without dead ends: 513 [2024-10-24 06:51:23,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=892, Invalid=3268, Unknown=0, NotChecked=0, Total=4160 [2024-10-24 06:51:23,078 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 863 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:23,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 744 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 06:51:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-10-24 06:51:23,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 355. [2024-10-24 06:51:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 242 states have (on average 1.2727272727272727) internal successors, (308), 244 states have internal predecessors, (308), 88 states have call successors, (88), 24 states have call predecessors, (88), 24 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-24 06:51:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 484 transitions. [2024-10-24 06:51:23,125 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 484 transitions. Word has length 156 [2024-10-24 06:51:23,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:23,125 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 484 transitions. [2024-10-24 06:51:23,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.84) internal successors, (121), 26 states have internal predecessors, (121), 10 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 9 states have call predecessors, (72), 10 states have call successors, (72) [2024-10-24 06:51:23,126 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 484 transitions. [2024-10-24 06:51:23,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 06:51:23,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:23,129 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:23,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 06:51:23,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:51:23,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:23,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:23,334 INFO L85 PathProgramCache]: Analyzing trace with hash -230893130, now seen corresponding path program 1 times [2024-10-24 06:51:23,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:23,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477046929] [2024-10-24 06:51:23,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:23,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:51:23,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:51:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:51:23,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:51:23,635 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:51:23,636 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:51:23,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 06:51:23,642 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 06:51:23,750 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:51:23,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:51:23 BoogieIcfgContainer [2024-10-24 06:51:23,754 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:51:23,755 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:51:23,755 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:51:23,755 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:51:23,756 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:51:13" (3/4) ... [2024-10-24 06:51:23,759 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:51:23,760 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:51:23,761 INFO L158 Benchmark]: Toolchain (without parser) took 11308.51ms. Allocated memory was 180.4MB in the beginning and 318.8MB in the end (delta: 138.4MB). Free memory was 120.6MB in the beginning and 182.6MB in the end (delta: -62.1MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2024-10-24 06:51:23,761 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:51:23,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.87ms. Allocated memory is still 180.4MB. Free memory was 120.2MB in the beginning and 104.3MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 06:51:23,762 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.36ms. Allocated memory is still 180.4MB. Free memory was 104.1MB in the beginning and 101.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:51:23,763 INFO L158 Benchmark]: Boogie Preprocessor took 51.50ms. Allocated memory is still 180.4MB. Free memory was 101.3MB in the beginning and 98.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 06:51:23,763 INFO L158 Benchmark]: RCFGBuilder took 491.68ms. Allocated memory is still 180.4MB. Free memory was 98.1MB in the beginning and 71.2MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 06:51:23,763 INFO L158 Benchmark]: TraceAbstraction took 10367.03ms. Allocated memory was 180.4MB in the beginning and 318.8MB in the end (delta: 138.4MB). Free memory was 70.6MB in the beginning and 182.6MB in the end (delta: -112.1MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-10-24 06:51:23,763 INFO L158 Benchmark]: Witness Printer took 5.68ms. Allocated memory is still 318.8MB. Free memory is still 182.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:51:23,765 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.87ms. Allocated memory is still 180.4MB. Free memory was 120.2MB in the beginning and 104.3MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.36ms. Allocated memory is still 180.4MB. Free memory was 104.1MB in the beginning and 101.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.50ms. Allocated memory is still 180.4MB. Free memory was 101.3MB in the beginning and 98.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 491.68ms. Allocated memory is still 180.4MB. Free memory was 98.1MB in the beginning and 71.2MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10367.03ms. Allocated memory was 180.4MB in the beginning and 318.8MB in the end (delta: 138.4MB). Free memory was 70.6MB in the beginning and 182.6MB in the end (delta: -112.1MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * Witness Printer took 5.68ms. Allocated memory is still 318.8MB. Free memory is still 182.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of someUnaryDOUBLEoperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 184, overapproximation of someBinaryArithmeticFLOAToperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] signed char var_1_22 = -8; [L40] signed long int var_1_23 = -32; [L41] unsigned char var_1_25 = 10; [L42] unsigned char var_1_27 = 128; [L43] float var_1_30 = 31.3; [L44] float var_1_32 = 15.25; [L45] double var_1_33 = 128.8; [L46] signed char var_1_34 = 4; [L47] signed char var_1_35 = 1; [L48] unsigned char var_1_36 = 16; [L49] unsigned long int last_1_var_1_10 = 128; [L50] unsigned long int last_1_var_1_16 = 1; [L51] double last_1_var_1_19 = 3.8; [L188] isInitial = 1 [L189] FCALL initially() [L190] COND TRUE 1 [L191] CALL updateLastVariables() [L179] last_1_var_1_10 = var_1_10 [L180] last_1_var_1_16 = var_1_16 [L181] last_1_var_1_19 = var_1_19 [L191] RET updateLastVariables() [L192] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L146] var_1_7 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L147] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L148] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L148] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L149] var_1_8 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L150] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L151] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L151] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L152] var_1_9 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L153] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L154] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L155] var_1_11 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L156] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L157] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L158] var_1_17 = __VERIFIER_nondet_ulong() [L159] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L159] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L160] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L161] var_1_18 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L162] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L163] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L164] var_1_20 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L165] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L166] var_1_27 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L167] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L168] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L168] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L169] var_1_32 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L170] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L171] var_1_34 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L172] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L173] CALL assume_abort_if_not(var_1_34 <= 5) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L173] RET assume_abort_if_not(var_1_34 <= 5) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L174] var_1_35 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L175] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L176] CALL assume_abort_if_not(var_1_35 <= 4) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L176] RET assume_abort_if_not(var_1_35 <= 4) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L192] RET updateVariables() [L193] CALL step() [L55] unsigned long int stepLocal_1 = last_1_var_1_16; [L56] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L57] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L58] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=1] [L66] COND TRUE var_1_12 == var_1_12 [L67] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L69] var_1_1 = (var_1_2 || (! var_1_3)) [L70] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L71] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L72] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L73] COND FALSE !(var_1_19 >= var_1_19) [L78] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=1, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L83] COND TRUE var_1_19 != var_1_19 [L84] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L92] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_2=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L93] COND FALSE !((var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L96] var_1_22 = ((((-25) < 0 ) ? -(-25) : (-25))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L97] COND FALSE !(var_1_7 > var_1_12) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L104] EXPR var_1_12 >> var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L104] EXPR ((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L104] COND FALSE !(var_1_18 <= ((((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7))))) [L107] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L111] COND TRUE \read(var_1_1) [L112] var_1_30 = ((((var_1_20) < ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32)))))) ? (var_1_20) : ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L114] COND FALSE !(var_1_9 >= var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L127] COND TRUE var_1_27 >= (var_1_9 + var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L128] COND TRUE (-0.95f * ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > var_1_20 [L129] var_1_36 = (var_1_27 - var_1_35) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L193] RET step() [L194] CALL, EXPR property() [L184-L185] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=-2, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=7/5, var_1_33=644/5, var_1_34=5, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=9, var_1_7=0, var_1_8=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1853 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1846 mSDsluCounter, 2509 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1887 mSDsCounter, 808 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2554 IncrementalHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 808 mSolverCounterUnsat, 622 mSDtfsCounter, 2554 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1002 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3063 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=5, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 578 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1239 NumberOfCodeBlocks, 1239 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1383 ConstructedInterpolants, 0 QuantifiedInterpolants, 4748 SizeOfPredicates, 10 NumberOfNonLiveVariables, 744 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 9630/9936 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 06:51:23,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a5e3c5868bad164e21cd0fc02186c2fb27c3de8083d1633d4818509bd4b4b8d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:51:25,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:51:25,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:51:25,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:51:25,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:51:25,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:51:25,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:51:25,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:51:25,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:51:25,930 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:51:25,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:51:25,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:51:25,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:51:25,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:51:25,932 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:51:25,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:51:25,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:51:25,932 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:51:25,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:51:25,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:51:25,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:51:25,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:51:25,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:51:25,936 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:51:25,937 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:51:25,937 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:51:25,937 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:51:25,937 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:51:25,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:51:25,937 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:51:25,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:51:25,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:51:25,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:51:25,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:51:25,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:51:25,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:51:25,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:51:25,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:51:25,948 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:51:25,948 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:51:25,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:51:25,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:51:25,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:51:25,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:51:25,950 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:51:25,951 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a5e3c5868bad164e21cd0fc02186c2fb27c3de8083d1633d4818509bd4b4b8d [2024-10-24 06:51:26,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:51:26,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:51:26,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:51:26,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:51:26,268 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:51:26,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2024-10-24 06:51:27,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:51:28,042 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:51:28,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2024-10-24 06:51:28,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6188aee3d/847c53a3506040348dac98e90fe11dc8/FLAGbe327d8c9 [2024-10-24 06:51:28,072 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6188aee3d/847c53a3506040348dac98e90fe11dc8 [2024-10-24 06:51:28,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:51:28,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:51:28,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:51:28,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:51:28,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:51:28,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:51:28" (1/1) ... [2024-10-24 06:51:28,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79ecf2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28, skipping insertion in model container [2024-10-24 06:51:28,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:51:28" (1/1) ... [2024-10-24 06:51:28,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:51:28,307 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i[919,932] [2024-10-24 06:51:28,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:51:28,389 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:51:28,401 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i[919,932] [2024-10-24 06:51:28,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:51:28,462 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:51:28,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28 WrapperNode [2024-10-24 06:51:28,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:51:28,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:51:28,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:51:28,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:51:28,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28" (1/1) ... [2024-10-24 06:51:28,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28" (1/1) ... [2024-10-24 06:51:28,515 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-10-24 06:51:28,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:51:28,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:51:28,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:51:28,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:51:28,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28" (1/1) ... [2024-10-24 06:51:28,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28" (1/1) ... [2024-10-24 06:51:28,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28" (1/1) ... [2024-10-24 06:51:28,560 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:51:28,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28" (1/1) ... [2024-10-24 06:51:28,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28" (1/1) ... [2024-10-24 06:51:28,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28" (1/1) ... [2024-10-24 06:51:28,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28" (1/1) ... [2024-10-24 06:51:28,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28" (1/1) ... [2024-10-24 06:51:28,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28" (1/1) ... [2024-10-24 06:51:28,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:51:28,606 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:51:28,606 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:51:28,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:51:28,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28" (1/1) ... [2024-10-24 06:51:28,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:51:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:51:28,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:51:28,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:51:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:51:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:51:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:51:28,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:51:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:51:28,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:51:28,809 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:51:28,811 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:51:31,305 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 06:51:31,308 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:51:31,367 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:51:31,367 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:51:31,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:51:31 BoogieIcfgContainer [2024-10-24 06:51:31,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:51:31,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:51:31,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:51:31,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:51:31,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:51:28" (1/3) ... [2024-10-24 06:51:31,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5631fdd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:51:31, skipping insertion in model container [2024-10-24 06:51:31,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:28" (2/3) ... [2024-10-24 06:51:31,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5631fdd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:51:31, skipping insertion in model container [2024-10-24 06:51:31,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:51:31" (3/3) ... [2024-10-24 06:51:31,380 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-11.i [2024-10-24 06:51:31,395 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:51:31,396 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:51:31,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:51:31,463 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7dc232c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:51:31,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:51:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 48 states have (on average 1.5625) internal successors, (75), 49 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:51:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 06:51:31,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:31,481 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:31,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:31,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:31,486 INFO L85 PathProgramCache]: Analyzing trace with hash -971117491, now seen corresponding path program 1 times [2024-10-24 06:51:31,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:51:31,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392303375] [2024-10-24 06:51:31,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:31,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:31,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:51:31,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:51:31,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 06:51:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:31,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:51:31,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:51:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-24 06:51:31,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:51:31,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:51:31,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392303375] [2024-10-24 06:51:31,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392303375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:31,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:31,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:51:31,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608773888] [2024-10-24 06:51:31,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:31,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:51:31,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:51:31,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:51:31,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:51:31,871 INFO L87 Difference]: Start difference. First operand has 75 states, 48 states have (on average 1.5625) internal successors, (75), 49 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:51:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:31,930 INFO L93 Difference]: Finished difference Result 147 states and 268 transitions. [2024-10-24 06:51:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:51:31,936 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 151 [2024-10-24 06:51:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:31,943 INFO L225 Difference]: With dead ends: 147 [2024-10-24 06:51:31,943 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 06:51:31,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:51:31,951 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:31,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:51:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 06:51:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 06:51:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:51:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 116 transitions. [2024-10-24 06:51:32,002 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 116 transitions. Word has length 151 [2024-10-24 06:51:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:32,003 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 116 transitions. [2024-10-24 06:51:32,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:51:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 116 transitions. [2024-10-24 06:51:32,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 06:51:32,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:32,005 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:32,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 06:51:32,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:32,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:32,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash -893796659, now seen corresponding path program 1 times [2024-10-24 06:51:32,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:51:32,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662589444] [2024-10-24 06:51:32,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:32,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:32,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:51:32,214 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:51:32,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 06:51:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:32,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 06:51:32,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:51:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:51:33,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:51:33,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:51:33,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662589444] [2024-10-24 06:51:33,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662589444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:33,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:33,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:51:33,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232174237] [2024-10-24 06:51:33,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:33,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:51:33,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:51:33,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:51:33,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:33,429 INFO L87 Difference]: Start difference. First operand 73 states and 116 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:51:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:33,816 INFO L93 Difference]: Finished difference Result 218 states and 347 transitions. [2024-10-24 06:51:33,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:51:33,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 151 [2024-10-24 06:51:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:33,823 INFO L225 Difference]: With dead ends: 218 [2024-10-24 06:51:33,825 INFO L226 Difference]: Without dead ends: 146 [2024-10-24 06:51:33,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:51:33,827 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 73 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:33,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 390 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:51:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-24 06:51:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 116. [2024-10-24 06:51:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 06:51:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 182 transitions. [2024-10-24 06:51:33,860 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 182 transitions. Word has length 151 [2024-10-24 06:51:33,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:33,861 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 182 transitions. [2024-10-24 06:51:33,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:51:33,862 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 182 transitions. [2024-10-24 06:51:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-24 06:51:33,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:33,864 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:33,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 06:51:34,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:34,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:34,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:34,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1324150038, now seen corresponding path program 1 times [2024-10-24 06:51:34,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:51:34,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831757434] [2024-10-24 06:51:34,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:34,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:34,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:51:34,073 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:51:34,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 06:51:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:34,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 06:51:34,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:51:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-10-24 06:51:34,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:51:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 06:51:35,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:51:35,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831757434] [2024-10-24 06:51:35,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831757434] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:51:35,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:51:35,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-24 06:51:35,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289889840] [2024-10-24 06:51:35,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:51:35,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 06:51:35,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:51:35,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 06:51:35,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 06:51:35,013 INFO L87 Difference]: Start difference. First operand 116 states and 182 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-24 06:51:37,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:37,147 INFO L93 Difference]: Finished difference Result 204 states and 311 transitions. [2024-10-24 06:51:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 06:51:37,150 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 152 [2024-10-24 06:51:37,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:37,154 INFO L225 Difference]: With dead ends: 204 [2024-10-24 06:51:37,154 INFO L226 Difference]: Without dead ends: 132 [2024-10-24 06:51:37,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-24 06:51:37,158 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 186 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:37,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 183 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 06:51:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-24 06:51:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2024-10-24 06:51:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 71 states have internal predecessors, (88), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 06:51:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2024-10-24 06:51:37,183 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 152 [2024-10-24 06:51:37,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:37,184 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2024-10-24 06:51:37,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-24 06:51:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2024-10-24 06:51:37,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 06:51:37,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:37,186 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:37,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 06:51:37,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:37,391 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:37,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:37,391 INFO L85 PathProgramCache]: Analyzing trace with hash 652521330, now seen corresponding path program 1 times [2024-10-24 06:51:37,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:51:37,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929884512] [2024-10-24 06:51:37,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:37,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:37,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:51:37,396 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:51:37,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 06:51:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:37,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 06:51:37,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:51:37,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:51:37,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:51:37,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:51:38,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929884512] [2024-10-24 06:51:38,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929884512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:38,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:38,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:51:38,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407100018] [2024-10-24 06:51:38,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:38,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:51:38,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:51:38,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:51:38,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:51:38,002 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:51:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:41,028 INFO L93 Difference]: Finished difference Result 204 states and 304 transitions. [2024-10-24 06:51:41,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:51:41,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-10-24 06:51:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:41,031 INFO L225 Difference]: With dead ends: 204 [2024-10-24 06:51:41,031 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 06:51:41,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:41,032 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 98 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:41,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 228 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 06:51:41,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 06:51:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2024-10-24 06:51:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 06:51:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 181 transitions. [2024-10-24 06:51:41,069 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 181 transitions. Word has length 153 [2024-10-24 06:51:41,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:41,070 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 181 transitions. [2024-10-24 06:51:41,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:51:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2024-10-24 06:51:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 06:51:41,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:41,072 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:41,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 06:51:41,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:41,273 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:41,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1678123661, now seen corresponding path program 1 times [2024-10-24 06:51:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:51:41,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612859188] [2024-10-24 06:51:41,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:41,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:41,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:51:41,280 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:51:41,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 06:51:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:41,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 06:51:41,463 INFO L278 TraceCheckSpWp]: Computing forward predicates...