./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_codestructure_steplocals_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_codestructure_steplocals_file-89.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 0e5b25db77af6087a8d68144f29b6dbfffc93c4c0b7ce6d33c40c5bcadf93148 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:19:00,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:19:00,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:19:00,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:19:00,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:19:00,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:19:00,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:19:00,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:19:00,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:19:00,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:19:00,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:19:00,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:19:00,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:19:00,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:19:00,692 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:19:00,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:19:00,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:19:00,693 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:19:00,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:19:00,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:19:00,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:19:00,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:19:00,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:19:00,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:19:00,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:19:00,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:19:00,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:19:00,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:19:00,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:19:00,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:19:00,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:19:00,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:19:00,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:19:00,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:19:00,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:19:00,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:19:00,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:19:00,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:19:00,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:19:00,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:19:00,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:19:00,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:19:00,702 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 -> 0e5b25db77af6087a8d68144f29b6dbfffc93c4c0b7ce6d33c40c5bcadf93148 [2024-10-13 00:19:00,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:19:00,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:19:00,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:19:00,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:19:00,945 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:19:00,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-89.i [2024-10-13 00:19:02,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:19:02,571 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:19:02,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-89.i [2024-10-13 00:19:02,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b246e0368/df791d1a3dfa43bb8859eb4b1848add5/FLAG6a35b3097 [2024-10-13 00:19:02,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b246e0368/df791d1a3dfa43bb8859eb4b1848add5 [2024-10-13 00:19:02,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:19:02,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:19:02,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:19:02,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:19:02,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:19:02,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:19:02" (1/1) ... [2024-10-13 00:19:02,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ac37d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:02, skipping insertion in model container [2024-10-13 00:19:02,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:19:02" (1/1) ... [2024-10-13 00:19:02,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:19:03,165 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_codestructure_steplocals_file-89.i[917,930] [2024-10-13 00:19:03,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:19:03,229 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:19:03,240 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_codestructure_steplocals_file-89.i[917,930] [2024-10-13 00:19:03,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:19:03,277 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:19:03,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:03 WrapperNode [2024-10-13 00:19:03,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:19:03,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:19:03,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:19:03,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:19:03,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:03" (1/1) ... [2024-10-13 00:19:03,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:03" (1/1) ... [2024-10-13 00:19:03,339 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-10-13 00:19:03,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:19:03,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:19:03,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:19:03,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:19:03,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:03" (1/1) ... [2024-10-13 00:19:03,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:03" (1/1) ... [2024-10-13 00:19:03,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:03" (1/1) ... [2024-10-13 00:19:03,389 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-13 00:19:03,389 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:03" (1/1) ... [2024-10-13 00:19:03,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:03" (1/1) ... [2024-10-13 00:19:03,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:03" (1/1) ... [2024-10-13 00:19:03,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:03" (1/1) ... [2024-10-13 00:19:03,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:03" (1/1) ... [2024-10-13 00:19:03,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:03" (1/1) ... [2024-10-13 00:19:03,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:19:03,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:19:03,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:19:03,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:19:03,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:03" (1/1) ... [2024-10-13 00:19:03,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:19:03,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:19:03,450 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-13 00:19:03,464 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-13 00:19:03,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:19:03,537 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:19:03,537 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:19:03,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:19:03,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:19:03,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:19:03,610 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:19:03,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:19:03,875 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 00:19:03,875 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:19:03,945 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:19:03,945 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:19:03,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:19:03 BoogieIcfgContainer [2024-10-13 00:19:03,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:19:03,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:19:03,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:19:03,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:19:03,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:19:02" (1/3) ... [2024-10-13 00:19:03,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7b506a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:19:03, skipping insertion in model container [2024-10-13 00:19:03,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:03" (2/3) ... [2024-10-13 00:19:03,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7b506a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:19:03, skipping insertion in model container [2024-10-13 00:19:03,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:19:03" (3/3) ... [2024-10-13 00:19:03,955 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-89.i [2024-10-13 00:19:03,971 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:19:03,972 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:19:04,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:19:04,051 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;@10b0629, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:19:04,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:19:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 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-13 00:19:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 00:19:04,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:19:04,074 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] [2024-10-13 00:19:04,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:19:04,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:19:04,081 INFO L85 PathProgramCache]: Analyzing trace with hash 749126443, now seen corresponding path program 1 times [2024-10-13 00:19:04,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:19:04,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433578369] [2024-10-13 00:19:04,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:19:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:19:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:19:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:19:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:19:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:19:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:19:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:19:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:19:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:19:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:19:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:19:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:19:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:19:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:19:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:19:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 00:19:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:19:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 00:19:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:19:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 00:19:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:19:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 00:19:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:19:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 00:19:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:19:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,449 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-13 00:19:04,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:19:04,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433578369] [2024-10-13 00:19:04,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433578369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:19:04,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:19:04,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:19:04,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842109308] [2024-10-13 00:19:04,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:19:04,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:19:04,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:19:04,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:19:04,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:19:04,479 INFO L87 Difference]: Start difference. First operand has 64 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 00:19:04,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:19:04,524 INFO L93 Difference]: Finished difference Result 125 states and 228 transitions. [2024-10-13 00:19:04,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:19:04,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 145 [2024-10-13 00:19:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:19:04,538 INFO L225 Difference]: With dead ends: 125 [2024-10-13 00:19:04,538 INFO L226 Difference]: Without dead ends: 62 [2024-10-13 00:19:04,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-13 00:19:04,545 INFO L432 NwaCegarLoop]: 95 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, 95 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-13 00:19:04,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:19:04,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-13 00:19:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-13 00:19:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 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-13 00:19:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2024-10-13 00:19:04,587 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 98 transitions. Word has length 145 [2024-10-13 00:19:04,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:19:04,587 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 98 transitions. [2024-10-13 00:19:04,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 00:19:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 98 transitions. [2024-10-13 00:19:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 00:19:04,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:19:04,592 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] [2024-10-13 00:19:04,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:19:04,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:19:04,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:19:04,594 INFO L85 PathProgramCache]: Analyzing trace with hash 822949487, now seen corresponding path program 1 times [2024-10-13 00:19:04,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:19:04,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750830857] [2024-10-13 00:19:04,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:19:04,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:19:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:19:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:19:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:19:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:19:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:19:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:04,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:19:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:19:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:19:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:19:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:19:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:19:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:19:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:19:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:19:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 00:19:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:19:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 00:19:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:19:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 00:19:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:19:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 00:19:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:19:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 00:19:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:19:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:05,161 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-13 00:19:05,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:19:05,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750830857] [2024-10-13 00:19:05,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750830857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:19:05,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:19:05,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:19:05,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613966152] [2024-10-13 00:19:05,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:19:05,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:19:05,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:19:05,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:19:05,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:19:05,168 INFO L87 Difference]: Start difference. First operand 62 states and 98 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-13 00:19:05,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:19:05,270 INFO L93 Difference]: Finished difference Result 183 states and 290 transitions. [2024-10-13 00:19:05,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:19:05,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 145 [2024-10-13 00:19:05,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:19:05,275 INFO L225 Difference]: With dead ends: 183 [2024-10-13 00:19:05,276 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 00:19:05,277 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-13 00:19:05,278 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 48 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:19:05,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 184 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:19:05,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 00:19:05,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2024-10-13 00:19:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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-13 00:19:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 187 transitions. [2024-10-13 00:19:05,311 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 187 transitions. Word has length 145 [2024-10-13 00:19:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:19:05,311 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 187 transitions. [2024-10-13 00:19:05,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-13 00:19:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 187 transitions. [2024-10-13 00:19:05,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 00:19:05,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:19:05,316 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] [2024-10-13 00:19:05,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:19:05,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:19:05,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:19:05,317 INFO L85 PathProgramCache]: Analyzing trace with hash 830635565, now seen corresponding path program 1 times [2024-10-13 00:19:05,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:19:05,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876869171] [2024-10-13 00:19:05,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:19:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:19:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 00:19:05,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394362578] [2024-10-13 00:19:05,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:19:05,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:19:05,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:19:05,423 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-13 00:19:05,424 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-13 00:19:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:19:05,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:19:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:19:05,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:19:05,779 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:19:05,780 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:19:05,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 00:19:05,982 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-13 00:19:05,985 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 00:19:06,072 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:19:06,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:19:06 BoogieIcfgContainer [2024-10-13 00:19:06,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:19:06,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:19:06,076 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:19:06,076 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:19:06,077 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:19:03" (3/4) ... [2024-10-13 00:19:06,079 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:19:06,080 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:19:06,081 INFO L158 Benchmark]: Toolchain (without parser) took 3131.34ms. Allocated memory was 146.8MB in the beginning and 232.8MB in the end (delta: 86.0MB). Free memory was 90.0MB in the beginning and 142.6MB in the end (delta: -52.6MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-10-13 00:19:06,081 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:19:06,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.72ms. Allocated memory is still 146.8MB. Free memory was 89.7MB in the beginning and 74.6MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 00:19:06,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.86ms. Allocated memory is still 146.8MB. Free memory was 74.6MB in the beginning and 71.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 00:19:06,082 INFO L158 Benchmark]: Boogie Preprocessor took 67.48ms. Allocated memory is still 146.8MB. Free memory was 71.1MB in the beginning and 66.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 00:19:06,083 INFO L158 Benchmark]: RCFGBuilder took 537.73ms. Allocated memory was 146.8MB in the beginning and 232.8MB in the end (delta: 86.0MB). Free memory was 66.6MB in the beginning and 183.3MB in the end (delta: -116.6MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-10-13 00:19:06,083 INFO L158 Benchmark]: TraceAbstraction took 2127.13ms. Allocated memory is still 232.8MB. Free memory was 182.2MB in the beginning and 143.6MB in the end (delta: 38.6MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2024-10-13 00:19:06,083 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 232.8MB. Free memory was 143.6MB in the beginning and 142.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:19:06,085 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.14ms. Allocated memory is still 146.8MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.72ms. Allocated memory is still 146.8MB. Free memory was 89.7MB in the beginning and 74.6MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.86ms. Allocated memory is still 146.8MB. Free memory was 74.6MB in the beginning and 71.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.48ms. Allocated memory is still 146.8MB. Free memory was 71.1MB in the beginning and 66.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 537.73ms. Allocated memory was 146.8MB in the beginning and 232.8MB in the end (delta: 86.0MB). Free memory was 66.6MB in the beginning and 183.3MB in the end (delta: -116.6MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2127.13ms. Allocated memory is still 232.8MB. Free memory was 182.2MB in the beginning and 143.6MB in the end (delta: 38.6MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 232.8MB. Free memory was 143.6MB in the beginning and 142.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 someBinaryDOUBLEComparisonOperation at line 138. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] signed long int var_1_2 = 16; [L24] signed long int var_1_3 = 4; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] signed long int var_1_6 = 256; [L28] signed long int var_1_7 = -1; [L29] unsigned short int var_1_8 = 32; [L30] signed long int var_1_9 = -16; [L31] unsigned short int var_1_10 = 5; [L32] unsigned short int var_1_11 = 128; [L33] unsigned char var_1_12 = 32; [L34] unsigned char var_1_13 = 1; [L35] unsigned char var_1_14 = 0; [L36] unsigned char var_1_15 = 0; [L37] double var_1_16 = 63.75; [L38] double var_1_17 = 8.5; [L39] signed short int var_1_18 = -64; [L142] isInitial = 1 [L143] FCALL initially() [L144] COND TRUE 1 [L145] FCALL updateLastVariables() [L146] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L99] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L100] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L100] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=4, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L101] var_1_3 = __VERIFIER_nondet_long() [L102] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L102] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L103] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L103] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L104] var_1_4 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L105] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L106] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L106] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=4, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L107] var_1_5 = __VERIFIER_nondet_long() [L108] CALL assume_abort_if_not(var_1_5 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L108] RET assume_abort_if_not(var_1_5 >= -2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L109] CALL assume_abort_if_not(var_1_5 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L109] RET assume_abort_if_not(var_1_5 <= 2147483646) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=256, var_1_7=-1, var_1_8=32, var_1_9=-16] [L110] var_1_6 = __VERIFIER_nondet_long() [L111] CALL assume_abort_if_not(var_1_6 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L111] RET assume_abort_if_not(var_1_6 >= -2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L112] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L112] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-1, var_1_8=32, var_1_9=-16] [L113] var_1_7 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_7 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L114] RET assume_abort_if_not(var_1_7 >= -2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L115] CALL assume_abort_if_not(var_1_7 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L115] RET assume_abort_if_not(var_1_7 <= 2147483646) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-16] [L116] var_1_9 = __VERIFIER_nondet_long() [L117] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L117] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L118] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L118] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L119] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L119] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_10=5, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L120] var_1_10 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L121] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L122] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L122] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=32, var_1_11=128, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L123] var_1_11 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L124] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L125] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L125] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L126] var_1_13 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L127] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L128] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L128] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L129] var_1_15 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L130] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L131] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L131] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L132] var_1_17 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L133] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L146] RET updateVariables() [L147] CALL step() [L43] COND FALSE !(var_1_2 != var_1_3) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L48] signed long int stepLocal_1 = var_1_5 / var_1_9; [L49] signed long int stepLocal_0 = var_1_2 * 256; VAL [isInitial=1, stepLocal_0=8192, stepLocal_1=0, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L50] COND FALSE !(var_1_6 >= stepLocal_1) [L57] var_1_8 = var_1_10 VAL [isInitial=1, stepLocal_0=8192, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L59] COND FALSE !(var_1_10 < var_1_1) VAL [isInitial=1, stepLocal_0=8192, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L70] unsigned char stepLocal_2 = var_1_12; VAL [isInitial=1, stepLocal_0=8192, stepLocal_2=32, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L71] COND FALSE !(stepLocal_2 > (((((var_1_3) < (var_1_8)) ? (var_1_3) : (var_1_8))) + var_1_10)) VAL [isInitial=1, stepLocal_0=8192, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L82] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, stepLocal_0=8192, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L89] COND FALSE !(\read(var_1_4)) [L92] var_1_16 = var_1_17 VAL [isInitial=1, stepLocal_0=8192, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=-64, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L95] var_1_18 = var_1_12 [L147] RET step() [L148] CALL, EXPR property() [L138-L139] return ((((((var_1_2 != var_1_3) ? (var_1_4 ? (var_1_1 == ((signed long int) ((((((((-5) > (var_1_5)) ? (-5) : (var_1_5)))) < (((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))) ? (((((-5) > (var_1_5)) ? (-5) : (var_1_5)))) : (((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7)))))))) : 1) : 1) && ((var_1_6 >= (var_1_5 / var_1_9)) ? ((var_1_3 < (var_1_2 * 256)) ? (var_1_8 == ((unsigned short int) ((((var_1_10) < (((((128) < (var_1_11)) ? (128) : (var_1_11))))) ? (var_1_10) : (((((128) < (var_1_11)) ? (128) : (var_1_11)))))))) : (var_1_8 == ((unsigned short int) var_1_11))) : (var_1_8 == ((unsigned short int) var_1_10)))) && ((var_1_10 < var_1_1) ? ((var_1_3 <= (5 - var_1_8)) ? (var_1_12 == ((unsigned char) var_1_13)) : ((var_1_3 == var_1_6) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) var_1_13)))) : 1)) && ((var_1_12 > (((((var_1_3) < (var_1_8)) ? (var_1_3) : (var_1_8))) + var_1_10)) ? ((! (var_1_8 >= var_1_5)) ? (var_1_4 ? (var_1_14 == ((unsigned char) 0)) : (var_1_14 == ((unsigned char) var_1_15))) : (var_1_14 == ((unsigned char) var_1_15))) : 1)) && (var_1_14 ? (var_1_15 ? (var_1_16 == ((double) var_1_17)) : (var_1_16 == ((double) (((((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) > (var_1_17)) ? ((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) : (var_1_17)))))) : (var_1_4 ? (var_1_16 == ((double) 5.2)) : (var_1_16 == ((double) var_1_17))))) && (var_1_18 == ((signed short int) var_1_12)) ; [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] [L19] reach_error() VAL [isInitial=1, var_1_10=32, var_1_11=0, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_1=32, var_1_2=32, var_1_3=32, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=0, var_1_8=32, var_1_9=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 189 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 376 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2208/2208 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-13 00:19:06,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_codestructure_steplocals_file-89.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 0e5b25db77af6087a8d68144f29b6dbfffc93c4c0b7ce6d33c40c5bcadf93148 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:19:08,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:19:08,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:19:08,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:19:08,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:19:08,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:19:08,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:19:08,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:19:08,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:19:08,228 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:19:08,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:19:08,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:19:08,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:19:08,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:19:08,231 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:19:08,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:19:08,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:19:08,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:19:08,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:19:08,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:19:08,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:19:08,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:19:08,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:19:08,236 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:19:08,236 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:19:08,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:19:08,237 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:19:08,237 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:19:08,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:19:08,237 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:19:08,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:19:08,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:19:08,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:19:08,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:19:08,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:19:08,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:19:08,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:19:08,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:19:08,239 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:19:08,240 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:19:08,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:19:08,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:19:08,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:19:08,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:19:08,241 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:19:08,241 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 -> 0e5b25db77af6087a8d68144f29b6dbfffc93c4c0b7ce6d33c40c5bcadf93148 [2024-10-13 00:19:08,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:19:08,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:19:08,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:19:08,593 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:19:08,593 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:19:08,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-89.i [2024-10-13 00:19:10,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:19:10,317 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:19:10,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-89.i [2024-10-13 00:19:10,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39159f961/fff69e994f1249979cdc3131f7e2ba84/FLAG3c13735d1 [2024-10-13 00:19:10,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39159f961/fff69e994f1249979cdc3131f7e2ba84 [2024-10-13 00:19:10,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:19:10,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:19:10,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:19:10,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:19:10,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:19:10,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:19:10" (1/1) ... [2024-10-13 00:19:10,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e15174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10, skipping insertion in model container [2024-10-13 00:19:10,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:19:10" (1/1) ... [2024-10-13 00:19:10,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:19:10,547 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_codestructure_steplocals_file-89.i[917,930] [2024-10-13 00:19:10,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:19:10,630 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:19:10,642 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_codestructure_steplocals_file-89.i[917,930] [2024-10-13 00:19:10,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:19:10,719 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:19:10,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10 WrapperNode [2024-10-13 00:19:10,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:19:10,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:19:10,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:19:10,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:19:10,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10" (1/1) ... [2024-10-13 00:19:10,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10" (1/1) ... [2024-10-13 00:19:10,770 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-10-13 00:19:10,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:19:10,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:19:10,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:19:10,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:19:10,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10" (1/1) ... [2024-10-13 00:19:10,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10" (1/1) ... [2024-10-13 00:19:10,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10" (1/1) ... [2024-10-13 00:19:10,798 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-13 00:19:10,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10" (1/1) ... [2024-10-13 00:19:10,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10" (1/1) ... [2024-10-13 00:19:10,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10" (1/1) ... [2024-10-13 00:19:10,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10" (1/1) ... [2024-10-13 00:19:10,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10" (1/1) ... [2024-10-13 00:19:10,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10" (1/1) ... [2024-10-13 00:19:10,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:19:10,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:19:10,827 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:19:10,827 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:19:10,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10" (1/1) ... [2024-10-13 00:19:10,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:19:10,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:19:10,867 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-13 00:19:10,869 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-13 00:19:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:19:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:19:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:19:10,910 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:19:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:19:10,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:19:10,975 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:19:10,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:19:11,420 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 00:19:11,420 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:19:11,486 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:19:11,487 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:19:11,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:19:11 BoogieIcfgContainer [2024-10-13 00:19:11,487 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:19:11,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:19:11,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:19:11,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:19:11,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:19:10" (1/3) ... [2024-10-13 00:19:11,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a8e9c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:19:11, skipping insertion in model container [2024-10-13 00:19:11,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:19:10" (2/3) ... [2024-10-13 00:19:11,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a8e9c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:19:11, skipping insertion in model container [2024-10-13 00:19:11,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:19:11" (3/3) ... [2024-10-13 00:19:11,495 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-89.i [2024-10-13 00:19:11,510 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:19:11,510 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:19:11,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:19:11,580 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;@66747383, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:19:11,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:19:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 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-13 00:19:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 00:19:11,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:19:11,601 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] [2024-10-13 00:19:11,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:19:11,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:19:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash 749126443, now seen corresponding path program 1 times [2024-10-13 00:19:11,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:19:11,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689963725] [2024-10-13 00:19:11,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:19:11,616 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-13 00:19:11,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:19:11,618 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-13 00:19:11,620 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-13 00:19:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:11,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:19:11,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:19:11,899 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-13 00:19:11,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:19:11,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:19:11,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689963725] [2024-10-13 00:19:11,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689963725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:19:11,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:19:11,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:19:11,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870829346] [2024-10-13 00:19:11,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:19:11,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:19:11,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:19:11,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:19:11,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:19:11,934 INFO L87 Difference]: Start difference. First operand has 64 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-13 00:19:12,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:19:12,035 INFO L93 Difference]: Finished difference Result 125 states and 228 transitions. [2024-10-13 00:19:12,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:19:12,047 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 145 [2024-10-13 00:19:12,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:19:12,054 INFO L225 Difference]: With dead ends: 125 [2024-10-13 00:19:12,054 INFO L226 Difference]: Without dead ends: 62 [2024-10-13 00:19:12,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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-13 00:19:12,060 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:19:12,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:19:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-13 00:19:12,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-13 00:19:12,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 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-13 00:19:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2024-10-13 00:19:12,108 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 98 transitions. Word has length 145 [2024-10-13 00:19:12,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:19:12,109 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 98 transitions. [2024-10-13 00:19:12,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-13 00:19:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 98 transitions. [2024-10-13 00:19:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 00:19:12,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:19:12,114 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] [2024-10-13 00:19:12,130 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-13 00:19:12,318 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-13 00:19:12,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:19:12,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:19:12,321 INFO L85 PathProgramCache]: Analyzing trace with hash 822949487, now seen corresponding path program 1 times [2024-10-13 00:19:12,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:19:12,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35661649] [2024-10-13 00:19:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:19:12,323 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-13 00:19:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:19:12,327 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-13 00:19:12,336 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-13 00:19:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:12,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 00:19:12,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:19:12,945 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-13 00:19:12,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:19:12,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:19:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35661649] [2024-10-13 00:19:12,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35661649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:19:12,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:19:12,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:19:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462568038] [2024-10-13 00:19:12,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:19:12,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:19:12,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:19:12,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:19:12,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:19:12,953 INFO L87 Difference]: Start difference. First operand 62 states and 98 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 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-13 00:19:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:19:13,138 INFO L93 Difference]: Finished difference Result 182 states and 288 transitions. [2024-10-13 00:19:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:19:13,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 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 145 [2024-10-13 00:19:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:19:13,141 INFO L225 Difference]: With dead ends: 182 [2024-10-13 00:19:13,141 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 00:19:13,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 143 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-13 00:19:13,145 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 21 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:19:13,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 182 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 00:19:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 00:19:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2024-10-13 00:19:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 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-13 00:19:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 185 transitions. [2024-10-13 00:19:13,178 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 185 transitions. Word has length 145 [2024-10-13 00:19:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:19:13,179 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 185 transitions. [2024-10-13 00:19:13,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 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-13 00:19:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 185 transitions. [2024-10-13 00:19:13,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 00:19:13,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:19:13,183 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] [2024-10-13 00:19:13,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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 00:19:13,384 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-13 00:19:13,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:19:13,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:19:13,385 INFO L85 PathProgramCache]: Analyzing trace with hash 830635565, now seen corresponding path program 1 times [2024-10-13 00:19:13,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:19:13,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504797739] [2024-10-13 00:19:13,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:19:13,386 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-13 00:19:13,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:19:13,388 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-13 00:19:13,389 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-13 00:19:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:19:13,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 00:19:13,769 INFO L278 TraceCheckSpWp]: Computing forward predicates...