./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_loopvsstraightlinecode_50-1loop_file-49.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_loopvsstraightlinecode_50-1loop_file-49.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 936aab998361efc45420d018b56df92fbb34844c50d535dc774b38d94c427472 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:30:39,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:30:39,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:30:39,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:30:39,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:30:39,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:30:39,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:30:39,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:30:39,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:30:39,538 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:30:39,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:30:39,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:30:39,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:30:39,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:30:39,542 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:30:39,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:30:39,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:30:39,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:30:39,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:30:39,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:30:39,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:30:39,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:30:39,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:30:39,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:30:39,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:30:39,548 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:30:39,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:30:39,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:30:39,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:30:39,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:30:39,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:30:39,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:30:39,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:30:39,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:30:39,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:30:39,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:30:39,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:30:39,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:30:39,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:30:39,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:30:39,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:30:39,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:30:39,552 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 -> 936aab998361efc45420d018b56df92fbb34844c50d535dc774b38d94c427472 [2024-10-13 04:30:39,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:30:39,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:30:39,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:30:39,888 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:30:39,888 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:30:39,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-49.i [2024-10-13 04:30:41,361 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:30:41,567 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:30:41,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-49.i [2024-10-13 04:30:41,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca12281f1/19d44188f34c4a639e173c408860c17c/FLAGb4425ea69 [2024-10-13 04:30:41,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca12281f1/19d44188f34c4a639e173c408860c17c [2024-10-13 04:30:41,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:30:41,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:30:41,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:30:41,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:30:41,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:30:41,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:30:41" (1/1) ... [2024-10-13 04:30:41,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73931647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:41, skipping insertion in model container [2024-10-13 04:30:41,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:30:41" (1/1) ... [2024-10-13 04:30:41,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:30:42,130 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_loopvsstraightlinecode_50-1loop_file-49.i[915,928] [2024-10-13 04:30:42,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:30:42,208 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:30:42,220 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_loopvsstraightlinecode_50-1loop_file-49.i[915,928] [2024-10-13 04:30:42,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:30:42,269 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:30:42,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:42 WrapperNode [2024-10-13 04:30:42,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:30:42,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:30:42,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:30:42,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:30:42,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:42" (1/1) ... [2024-10-13 04:30:42,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:42" (1/1) ... [2024-10-13 04:30:42,331 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-10-13 04:30:42,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:30:42,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:30:42,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:30:42,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:30:42,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:42" (1/1) ... [2024-10-13 04:30:42,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:42" (1/1) ... [2024-10-13 04:30:42,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:42" (1/1) ... [2024-10-13 04:30:42,375 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 04:30:42,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:42" (1/1) ... [2024-10-13 04:30:42,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:42" (1/1) ... [2024-10-13 04:30:42,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:42" (1/1) ... [2024-10-13 04:30:42,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:42" (1/1) ... [2024-10-13 04:30:42,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:42" (1/1) ... [2024-10-13 04:30:42,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:42" (1/1) ... [2024-10-13 04:30:42,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:30:42,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:30:42,417 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:30:42,417 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:30:42,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:42" (1/1) ... [2024-10-13 04:30:42,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:30:42,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:30:42,451 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 04:30:42,453 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 04:30:42,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:30:42,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:30:42,491 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:30:42,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:30:42,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:30:42,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:30:42,572 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:30:42,574 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:30:42,944 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 04:30:42,945 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:30:42,974 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:30:42,974 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:30:42,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:30:42 BoogieIcfgContainer [2024-10-13 04:30:42,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:30:42,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:30:42,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:30:42,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:30:42,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:30:41" (1/3) ... [2024-10-13 04:30:42,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edd21a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:30:42, skipping insertion in model container [2024-10-13 04:30:42,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:42" (2/3) ... [2024-10-13 04:30:42,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edd21a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:30:42, skipping insertion in model container [2024-10-13 04:30:42,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:30:42" (3/3) ... [2024-10-13 04:30:42,985 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-49.i [2024-10-13 04:30:43,001 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:30:43,001 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:30:43,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:30:43,063 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;@6e36e708, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:30:43,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:30:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:30:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 04:30:43,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:30:43,081 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:43,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:30:43,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:30:43,087 INFO L85 PathProgramCache]: Analyzing trace with hash 764713851, now seen corresponding path program 1 times [2024-10-13 04:30:43,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:30:43,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155812791] [2024-10-13 04:30:43,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:30:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:30:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:30:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:30:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:30:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:30:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:30:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:30:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:30:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:30:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:30:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:30:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:30:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:30:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 04:30:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:30:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 04:30:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:30:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 04:30:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:30:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:30:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:30:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:30:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:30:43,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:30:43,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155812791] [2024-10-13 04:30:43,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155812791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:30:43,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:30:43,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:30:43,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359558892] [2024-10-13 04:30:43,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:30:43,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:30:43,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:30:43,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:30:43,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:30:43,615 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:30:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:30:43,666 INFO L93 Difference]: Finished difference Result 130 states and 226 transitions. [2024-10-13 04:30:43,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:30:43,668 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2024-10-13 04:30:43,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:30:43,676 INFO L225 Difference]: With dead ends: 130 [2024-10-13 04:30:43,677 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 04:30:43,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 04:30:43,683 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:30:43,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:30:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 04:30:43,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 04:30:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:30:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2024-10-13 04:30:43,738 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 131 [2024-10-13 04:30:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:30:43,739 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 96 transitions. [2024-10-13 04:30:43,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:30:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2024-10-13 04:30:43,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 04:30:43,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:30:43,745 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:43,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:30:43,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:30:43,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:30:43,747 INFO L85 PathProgramCache]: Analyzing trace with hash -637945467, now seen corresponding path program 1 times [2024-10-13 04:30:43,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:30:43,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189145877] [2024-10-13 04:30:43,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:30:43,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:30:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:30:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:30:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:30:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:30:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:30:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:30:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:30:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:30:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:30:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:30:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:30:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:30:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 04:30:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:30:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 04:30:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:30:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 04:30:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:30:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:30:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:30:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:30:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:30:44,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:30:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189145877] [2024-10-13 04:30:44,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189145877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:30:44,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:30:44,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:30:44,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261320488] [2024-10-13 04:30:44,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:30:44,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:30:44,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:30:44,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:30:44,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:30:44,471 INFO L87 Difference]: Start difference. First operand 63 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:30:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:30:44,674 INFO L93 Difference]: Finished difference Result 187 states and 285 transitions. [2024-10-13 04:30:44,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:30:44,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2024-10-13 04:30:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:30:44,678 INFO L225 Difference]: With dead ends: 187 [2024-10-13 04:30:44,678 INFO L226 Difference]: Without dead ends: 125 [2024-10-13 04:30:44,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:30:44,680 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 68 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:30:44,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 263 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:30:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-13 04:30:44,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2024-10-13 04:30:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 states have internal predecessors, (74), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 04:30:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 158 transitions. [2024-10-13 04:30:44,706 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 158 transitions. Word has length 131 [2024-10-13 04:30:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:30:44,707 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 158 transitions. [2024-10-13 04:30:44,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:30:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 158 transitions. [2024-10-13 04:30:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 04:30:44,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:30:44,709 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:44,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:30:44,710 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:30:44,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:30:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash -578852025, now seen corresponding path program 1 times [2024-10-13 04:30:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:30:44,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159637726] [2024-10-13 04:30:44,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:30:44,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:30:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:30:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:30:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:30:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:30:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:30:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:30:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:30:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:30:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:30:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:30:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:30:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:30:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 04:30:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:30:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 04:30:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:30:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 04:30:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:30:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:30:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:30:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:30:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:30:45,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:30:45,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159637726] [2024-10-13 04:30:45,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159637726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:30:45,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:30:45,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:30:45,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222622221] [2024-10-13 04:30:45,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:30:45,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:30:45,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:30:45,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:30:45,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:30:45,100 INFO L87 Difference]: Start difference. First operand 104 states and 158 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:30:45,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:30:45,146 INFO L93 Difference]: Finished difference Result 167 states and 255 transitions. [2024-10-13 04:30:45,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:30:45,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-10-13 04:30:45,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:30:45,149 INFO L225 Difference]: With dead ends: 167 [2024-10-13 04:30:45,150 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 04:30:45,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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 04:30:45,152 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:30:45,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:30:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 04:30:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-13 04:30:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 04:30:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 159 transitions. [2024-10-13 04:30:45,176 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 159 transitions. Word has length 132 [2024-10-13 04:30:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:30:45,176 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 159 transitions. [2024-10-13 04:30:45,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:30:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 159 transitions. [2024-10-13 04:30:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 04:30:45,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:30:45,183 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:45,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:30:45,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:30:45,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:30:45,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1496859030, now seen corresponding path program 1 times [2024-10-13 04:30:45,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:30:45,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741423222] [2024-10-13 04:30:45,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:30:45,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:30:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:30:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:30:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:30:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:30:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:30:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:30:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:30:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:30:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:30:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:30:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:30:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:30:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 04:30:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:30:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 04:30:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:30:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 04:30:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:30:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:30:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:30:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:30:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-13 04:30:45,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:30:45,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741423222] [2024-10-13 04:30:45,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741423222] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:30:45,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132047271] [2024-10-13 04:30:45,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:30:45,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:30:45,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:30:45,750 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 04:30:45,753 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 04:30:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:45,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 04:30:45,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:30:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-13 04:30:46,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:30:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-13 04:30:47,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132047271] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:30:47,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 04:30:47,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 17 [2024-10-13 04:30:47,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224820798] [2024-10-13 04:30:47,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 04:30:47,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 04:30:47,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:30:47,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 04:30:47,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-13 04:30:47,574 INFO L87 Difference]: Start difference. First operand 105 states and 159 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2024-10-13 04:30:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:30:48,935 INFO L93 Difference]: Finished difference Result 477 states and 694 transitions. [2024-10-13 04:30:48,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-13 04:30:48,936 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) Word has length 133 [2024-10-13 04:30:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:30:48,940 INFO L225 Difference]: With dead ends: 477 [2024-10-13 04:30:48,940 INFO L226 Difference]: Without dead ends: 414 [2024-10-13 04:30:48,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=450, Invalid=1190, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 04:30:48,943 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 421 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 04:30:48,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 499 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 04:30:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-13 04:30:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 325. [2024-10-13 04:30:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 207 states have (on average 1.2560386473429952) internal successors, (260), 208 states have internal predecessors, (260), 107 states have call successors, (107), 10 states have call predecessors, (107), 10 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2024-10-13 04:30:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 474 transitions. [2024-10-13 04:30:49,040 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 474 transitions. Word has length 133 [2024-10-13 04:30:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:30:49,043 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 474 transitions. [2024-10-13 04:30:49,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2024-10-13 04:30:49,043 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 474 transitions. [2024-10-13 04:30:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 04:30:49,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:30:49,046 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:49,067 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 04:30:49,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:30:49,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:30:49,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:30:49,252 INFO L85 PathProgramCache]: Analyzing trace with hash -135980054, now seen corresponding path program 1 times [2024-10-13 04:30:49,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:30:49,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979458382] [2024-10-13 04:30:49,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:30:49,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:30:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:30:49,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1871628549] [2024-10-13 04:30:49,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:30:49,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:30:49,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:30:49,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:30:49,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 04:30:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:30:49,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:30:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:30:49,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:30:49,699 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:30:49,700 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:30:49,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 04:30:49,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:30:49,906 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 04:30:50,015 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:30:50,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:30:50 BoogieIcfgContainer [2024-10-13 04:30:50,019 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:30:50,020 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:30:50,020 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:30:50,020 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:30:50,020 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:30:42" (3/4) ... [2024-10-13 04:30:50,022 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:30:50,023 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:30:50,024 INFO L158 Benchmark]: Toolchain (without parser) took 8093.21ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 149.5MB in the beginning and 149.1MB in the end (delta: 428.0kB). Peak memory consumption was 80.1MB. Max. memory is 16.1GB. [2024-10-13 04:30:50,024 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 180.4MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:30:50,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.18ms. Allocated memory is still 180.4MB. Free memory was 149.5MB in the beginning and 134.0MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 04:30:50,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.88ms. Allocated memory is still 180.4MB. Free memory was 134.0MB in the beginning and 129.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:30:50,025 INFO L158 Benchmark]: Boogie Preprocessor took 80.88ms. Allocated memory is still 180.4MB. Free memory was 129.8MB in the beginning and 124.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:30:50,028 INFO L158 Benchmark]: RCFGBuilder took 558.37ms. Allocated memory is still 180.4MB. Free memory was 124.6MB in the beginning and 127.8MB in the end (delta: -3.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 04:30:50,028 INFO L158 Benchmark]: TraceAbstraction took 7042.65ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 127.4MB in the beginning and 149.1MB in the end (delta: -21.7MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2024-10-13 04:30:50,028 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 262.1MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:30:50,029 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.18ms. Allocated memory is still 180.4MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.18ms. Allocated memory is still 180.4MB. Free memory was 149.5MB in the beginning and 134.0MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.88ms. Allocated memory is still 180.4MB. Free memory was 134.0MB in the beginning and 129.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.88ms. Allocated memory is still 180.4MB. Free memory was 129.8MB in the beginning and 124.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 558.37ms. Allocated memory is still 180.4MB. Free memory was 124.6MB in the beginning and 127.8MB in the end (delta: -3.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7042.65ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 127.4MB in the beginning and 149.1MB in the end (delta: -21.7MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 262.1MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of bitwiseAnd at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 10; [L23] unsigned long int var_1_3 = 3171453299; [L24] unsigned long int var_1_4 = 2038274679; [L25] unsigned long int var_1_5 = 1375699353; [L26] unsigned short int var_1_8 = 16; [L27] unsigned char var_1_12 = 1; [L28] unsigned char var_1_13 = 1; [L29] double var_1_14 = 64.45; [L30] float var_1_15 = 31.15; [L31] float var_1_16 = 16.4; [L32] double var_1_17 = 100.625; [L33] double var_1_18 = 128.1; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 8; [L36] unsigned char var_1_21 = 100; [L37] unsigned char var_1_22 = 0; [L38] signed char var_1_23 = 2; [L39] unsigned char var_1_24 = 0; [L40] unsigned long int last_1_var_1_1 = 10; [L41] unsigned short int last_1_var_1_8 = 16; [L42] unsigned char last_1_var_1_12 = 1; [L43] unsigned char last_1_var_1_19 = 1; [L44] unsigned char last_1_var_1_22 = 0; [L134] isInitial = 1 [L135] FCALL initially() [L136] int k_loop; [L137] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L137] COND TRUE k_loop < 1 [L138] CALL updateLastVariables() [L123] last_1_var_1_1 = var_1_1 [L124] last_1_var_1_8 = var_1_8 [L125] last_1_var_1_12 = var_1_12 [L126] last_1_var_1_19 = var_1_19 [L127] last_1_var_1_22 = var_1_22 [L138] RET updateLastVariables() [L139] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L89] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L90] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L90] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L91] var_1_4 = __VERIFIER_nondet_ulong() [L92] CALL assume_abort_if_not(var_1_4 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L92] RET assume_abort_if_not(var_1_4 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L93] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L93] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=1375699353, var_1_8=16] [L94] var_1_5 = __VERIFIER_nondet_ulong() [L95] CALL assume_abort_if_not(var_1_5 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L95] RET assume_abort_if_not(var_1_5 >= 1073741824) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L96] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L96] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L98] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L99] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L99] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L100] var_1_15 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L102] var_1_16 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L103] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L104] var_1_17 = __VERIFIER_nondet_double() [L105] 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, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L105] 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, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L106] var_1_18 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L107] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L108] var_1_20 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L109] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L110] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L110] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L111] var_1_21 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L112] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L113] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L113] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L114] var_1_23 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_23 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L115] RET assume_abort_if_not(var_1_23 >= -128) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L116] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L116] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L117] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L117] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L118] var_1_24 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L119] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L120] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L120] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L139] RET updateVariables() [L140] CALL step() [L48] COND TRUE ! last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L49] COND TRUE (last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19 [L50] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L55] COND FALSE !(var_1_13 && last_1_var_1_22) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=16] [L62] var_1_8 = ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19))))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=102] [L63] COND TRUE (((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16 [L64] var_1_14 = ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=102] [L66] COND TRUE \read(last_1_var_1_12) [L67] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=6442450671, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=102] [L69] EXPR var_1_19 & var_1_4 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=6442450671, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=102] [L69] COND FALSE !((-2 / var_1_23) >= (var_1_19 & var_1_4)) [L84] var_1_22 = var_1_13 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=6442450671, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=102] [L140] RET step() [L141] CALL, EXPR property() [L130] EXPR (((((last_1_var_1_12 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))))))) && ((! last_1_var_1_22) ? (((last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && last_1_var_1_22) ? ((var_1_4 > (256u * last_1_var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_19 & var_1_4)) ? ((var_1_21 >= (var_1_1 + var_1_5)) ? (((~ var_1_19) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=6442450671, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=102] [L130-L131] return (((((last_1_var_1_12 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))))))) && ((! last_1_var_1_22) ? (((last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && last_1_var_1_22) ? ((var_1_4 > (256u * last_1_var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_19 & var_1_4)) ? ((var_1_21 >= (var_1_1 + var_1_5)) ? (((~ var_1_19) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=6442450671, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=102] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=6442450671, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=1073741823, var_1_5=5368709120, var_1_8=102] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 5, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 511 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 489 mSDsluCounter, 1031 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 686 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 808 IncrementalHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 345 mSDtfsCounter, 808 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=4, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 110 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 928 NumberOfCodeBlocks, 928 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 3223 SizeOfPredicates, 3 NumberOfNonLiveVariables, 314 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 4878/5040 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 04:30:50,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-49.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 936aab998361efc45420d018b56df92fbb34844c50d535dc774b38d94c427472 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:30:52,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:30:52,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:30:52,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:30:52,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:30:52,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:30:52,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:30:52,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:30:52,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:30:52,407 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:30:52,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:30:52,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:30:52,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:30:52,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:30:52,409 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:30:52,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:30:52,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:30:52,410 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:30:52,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:30:52,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:30:52,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:30:52,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:30:52,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:30:52,416 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:30:52,416 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:30:52,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:30:52,416 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:30:52,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:30:52,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:30:52,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:30:52,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:30:52,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:30:52,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:30:52,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:30:52,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:30:52,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:30:52,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:30:52,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:30:52,419 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:30:52,419 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:30:52,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:30:52,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:30:52,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:30:52,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:30:52,422 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:30:52,422 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 -> 936aab998361efc45420d018b56df92fbb34844c50d535dc774b38d94c427472 [2024-10-13 04:30:52,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:30:52,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:30:52,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:30:52,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:30:52,760 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:30:52,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-49.i [2024-10-13 04:30:54,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:30:54,537 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:30:54,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-49.i [2024-10-13 04:30:54,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63390c052/f1fb52dc537c4490a2bd94f19135e074/FLAG585c2b72b [2024-10-13 04:30:54,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63390c052/f1fb52dc537c4490a2bd94f19135e074 [2024-10-13 04:30:54,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:30:54,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:30:54,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:30:54,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:30:54,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:30:54,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:30:54" (1/1) ... [2024-10-13 04:30:54,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d724e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:54, skipping insertion in model container [2024-10-13 04:30:54,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:30:54" (1/1) ... [2024-10-13 04:30:54,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:30:55,120 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_loopvsstraightlinecode_50-1loop_file-49.i[915,928] [2024-10-13 04:30:55,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:30:55,229 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:30:55,246 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_loopvsstraightlinecode_50-1loop_file-49.i[915,928] [2024-10-13 04:30:55,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:30:55,310 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:30:55,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:55 WrapperNode [2024-10-13 04:30:55,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:30:55,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:30:55,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:30:55,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:30:55,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:55" (1/1) ... [2024-10-13 04:30:55,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:55" (1/1) ... [2024-10-13 04:30:55,372 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-10-13 04:30:55,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:30:55,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:30:55,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:30:55,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:30:55,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:55" (1/1) ... [2024-10-13 04:30:55,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:55" (1/1) ... [2024-10-13 04:30:55,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:55" (1/1) ... [2024-10-13 04:30:55,409 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 04:30:55,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:55" (1/1) ... [2024-10-13 04:30:55,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:55" (1/1) ... [2024-10-13 04:30:55,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:55" (1/1) ... [2024-10-13 04:30:55,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:55" (1/1) ... [2024-10-13 04:30:55,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:55" (1/1) ... [2024-10-13 04:30:55,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:55" (1/1) ... [2024-10-13 04:30:55,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:30:55,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:30:55,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:30:55,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:30:55,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:55" (1/1) ... [2024-10-13 04:30:55,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:30:55,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:30:55,490 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 04:30:55,502 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 04:30:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:30:55,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:30:55,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:30:55,544 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:30:55,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:30:55,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:30:55,626 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:30:55,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:30:56,128 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-13 04:30:56,128 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:30:56,183 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:30:56,183 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:30:56,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:30:56 BoogieIcfgContainer [2024-10-13 04:30:56,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:30:56,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:30:56,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:30:56,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:30:56,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:30:54" (1/3) ... [2024-10-13 04:30:56,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ddb077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:30:56, skipping insertion in model container [2024-10-13 04:30:56,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:30:55" (2/3) ... [2024-10-13 04:30:56,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ddb077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:30:56, skipping insertion in model container [2024-10-13 04:30:56,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:30:56" (3/3) ... [2024-10-13 04:30:56,191 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-49.i [2024-10-13 04:30:56,205 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:30:56,206 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:30:56,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:30:56,280 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;@1cab3b12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:30:56,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:30:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:30:56,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 04:30:56,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:30:56,300 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:56,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:30:56,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:30:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash -288851931, now seen corresponding path program 1 times [2024-10-13 04:30:56,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:30:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734330625] [2024-10-13 04:30:56,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:30:56,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 04:30:56,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:30:56,326 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 04:30:56,328 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 04:30:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:56,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:30:56,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:30:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-10-13 04:30:56,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:30:56,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:30:56,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734330625] [2024-10-13 04:30:56,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734330625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:30:56,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:30:56,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:30:56,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899084036] [2024-10-13 04:30:56,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:30:56,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:30:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:30:56,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:30:56,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:30:56,715 INFO L87 Difference]: Start difference. First operand has 57 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:30:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:30:56,825 INFO L93 Difference]: Finished difference Result 112 states and 198 transitions. [2024-10-13 04:30:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:30:56,827 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 128 [2024-10-13 04:30:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:30:56,834 INFO L225 Difference]: With dead ends: 112 [2024-10-13 04:30:56,834 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 04:30:56,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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 04:30:56,842 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:30:56,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:30:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 04:30:56,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 04:30:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:30:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2024-10-13 04:30:56,880 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 128 [2024-10-13 04:30:56,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:30:56,880 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2024-10-13 04:30:56,881 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:30:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2024-10-13 04:30:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 04:30:56,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:30:56,884 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:56,892 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 04:30:57,084 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 04:30:57,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:30:57,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:30:57,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1105910181, now seen corresponding path program 1 times [2024-10-13 04:30:57,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:30:57,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792931886] [2024-10-13 04:30:57,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:30:57,088 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 04:30:57,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:30:57,091 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 04:30:57,093 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 04:30:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:57,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 04:30:57,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:30:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:30:57,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:30:57,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:30:57,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792931886] [2024-10-13 04:30:57,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792931886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:30:57,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:30:57,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:30:57,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146729884] [2024-10-13 04:30:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:30:57,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:30:57,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:30:57,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:30:57,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:30:57,732 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:30:58,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:30:58,150 INFO L93 Difference]: Finished difference Result 167 states and 255 transitions. [2024-10-13 04:30:58,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:30:58,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 128 [2024-10-13 04:30:58,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:30:58,154 INFO L225 Difference]: With dead ends: 167 [2024-10-13 04:30:58,155 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 04:30:58,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:30:58,157 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 59 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:30:58,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 230 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:30:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 04:30:58,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2024-10-13 04:30:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 04:30:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2024-10-13 04:30:58,191 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 142 transitions. Word has length 128 [2024-10-13 04:30:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:30:58,191 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 142 transitions. [2024-10-13 04:30:58,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:30:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 142 transitions. [2024-10-13 04:30:58,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 04:30:58,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:30:58,194 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:58,204 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 04:30:58,394 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 04:30:58,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:30:58,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:30:58,396 INFO L85 PathProgramCache]: Analyzing trace with hash 259292825, now seen corresponding path program 1 times [2024-10-13 04:30:58,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:30:58,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884596969] [2024-10-13 04:30:58,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:30:58,397 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 04:30:58,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:30:58,398 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 04:30:58,399 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 04:30:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:30:58,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 04:30:58,601 INFO L278 TraceCheckSpWp]: Computing forward predicates...