./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_100-1loop_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_100-1loop_file-43.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 7e66f2766686731553c198a13682fe7d31c9aeab700c26b7283920d0b82d9f8b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:13:56,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:13:56,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:13:56,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:13:56,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:13:56,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:13:56,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:13:56,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:13:56,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:13:56,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:13:56,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:13:56,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:13:56,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:13:56,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:13:56,683 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:13:56,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:13:56,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:13:56,684 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:13:56,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:13:56,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:13:56,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:13:56,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:13:56,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:13:56,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:13:56,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:13:56,686 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:13:56,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:13:56,686 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:13:56,687 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:13:56,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:13:56,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:13:56,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:13:56,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:13:56,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:13:56,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:13:56,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:13:56,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:13:56,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:13:56,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:13:56,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:13:56,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:13:56,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:13:56,692 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 -> 7e66f2766686731553c198a13682fe7d31c9aeab700c26b7283920d0b82d9f8b [2024-10-14 11:13:56,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:13:56,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:13:56,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:13:56,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:13:56,971 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:13:56,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-43.i [2024-10-14 11:13:58,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:13:58,625 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:13:58,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-43.i [2024-10-14 11:13:58,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7af4788d/4b4793998e0c4ee9936913cf8527cf58/FLAGdacdaad25 [2024-10-14 11:13:58,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7af4788d/4b4793998e0c4ee9936913cf8527cf58 [2024-10-14 11:13:58,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:13:58,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:13:58,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:13:58,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:13:58,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:13:58,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:58" (1/1) ... [2024-10-14 11:13:58,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61252e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:58, skipping insertion in model container [2024-10-14 11:13:58,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:58" (1/1) ... [2024-10-14 11:13:59,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:13:59,185 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_100-1loop_file-43.i[916,929] [2024-10-14 11:13:59,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:13:59,339 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:13:59,350 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_100-1loop_file-43.i[916,929] [2024-10-14 11:13:59,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:13:59,441 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:13:59,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:59 WrapperNode [2024-10-14 11:13:59,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:13:59,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:13:59,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:13:59,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:13:59,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:59" (1/1) ... [2024-10-14 11:13:59,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:59" (1/1) ... [2024-10-14 11:13:59,508 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 285 [2024-10-14 11:13:59,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:13:59,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:13:59,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:13:59,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:13:59,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:59" (1/1) ... [2024-10-14 11:13:59,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:59" (1/1) ... [2024-10-14 11:13:59,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:59" (1/1) ... [2024-10-14 11:13:59,566 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-14 11:13:59,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:59" (1/1) ... [2024-10-14 11:13:59,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:59" (1/1) ... [2024-10-14 11:13:59,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:59" (1/1) ... [2024-10-14 11:13:59,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:59" (1/1) ... [2024-10-14 11:13:59,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:59" (1/1) ... [2024-10-14 11:13:59,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:59" (1/1) ... [2024-10-14 11:13:59,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:13:59,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:13:59,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:13:59,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:13:59,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:59" (1/1) ... [2024-10-14 11:13:59,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:13:59,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:13:59,667 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-14 11:13:59,673 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-14 11:13:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:13:59,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:13:59,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:13:59,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:13:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:13:59,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:13:59,823 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:13:59,825 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:14:00,362 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-14 11:14:00,363 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:14:00,410 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:14:00,410 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:14:00,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:14:00 BoogieIcfgContainer [2024-10-14 11:14:00,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:14:00,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:14:00,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:14:00,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:14:00,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:13:58" (1/3) ... [2024-10-14 11:14:00,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f99fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:14:00, skipping insertion in model container [2024-10-14 11:14:00,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:59" (2/3) ... [2024-10-14 11:14:00,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f99fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:14:00, skipping insertion in model container [2024-10-14 11:14:00,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:14:00" (3/3) ... [2024-10-14 11:14:00,422 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-43.i [2024-10-14 11:14:00,442 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:14:00,443 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:14:00,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:14:00,531 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;@e3c6f2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:14:00,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:14:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 82 states have internal predecessors, (120), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 11:14:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-14 11:14:00,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:14:00,561 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:14:00,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:14:00,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:14:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1932969705, now seen corresponding path program 1 times [2024-10-14 11:14:00,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:14:00,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312252252] [2024-10-14 11:14:00,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:14:00,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:14:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:00,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:14:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:00,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:14:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:00,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:14:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:00,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:14:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:00,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:14:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:00,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:14:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:00,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:14:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:00,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:14:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:00,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:14:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:00,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:14:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:14:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:14:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:14:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:14:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:14:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:14:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:14:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 11:14:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 11:14:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 11:14:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 11:14:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:14:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 11:14:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:14:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 11:14:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:14:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 11:14:01,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:14:01,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312252252] [2024-10-14 11:14:01,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312252252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:14:01,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:14:01,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:14:01,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437105333] [2024-10-14 11:14:01,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:14:01,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:14:01,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:14:01,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:14:01,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:14:01,147 INFO L87 Difference]: Start difference. First operand has 110 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 82 states have internal predecessors, (120), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 11:14:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:14:01,202 INFO L93 Difference]: Finished difference Result 219 states and 369 transitions. [2024-10-14 11:14:01,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:14:01,204 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 177 [2024-10-14 11:14:01,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:14:01,213 INFO L225 Difference]: With dead ends: 219 [2024-10-14 11:14:01,213 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 11:14:01,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-14 11:14:01,222 INFO L432 NwaCegarLoop]: 162 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, 162 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-14 11:14:01,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:14:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 11:14:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-14 11:14:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 11:14:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 165 transitions. [2024-10-14 11:14:01,274 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 165 transitions. Word has length 177 [2024-10-14 11:14:01,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:14:01,275 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 165 transitions. [2024-10-14 11:14:01,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 11:14:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 165 transitions. [2024-10-14 11:14:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-14 11:14:01,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:14:01,282 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:14:01,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:14:01,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:14:01,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:14:01,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1624913803, now seen corresponding path program 1 times [2024-10-14 11:14:01,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:14:01,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528068684] [2024-10-14 11:14:01,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:14:01,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:14:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:14:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:14:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:14:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:14:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:14:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:14:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:14:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:14:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:14:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:14:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:14:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:14:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:14:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:14:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:14:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:14:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:14:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 11:14:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 11:14:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 11:14:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 11:14:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:14:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 11:14:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:14:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 11:14:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:14:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 11:14:01,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:14:01,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528068684] [2024-10-14 11:14:01,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528068684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:14:01,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:14:01,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:14:01,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416552944] [2024-10-14 11:14:01,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:14:01,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:14:01,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:14:01,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:14:01,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:14:01,883 INFO L87 Difference]: Start difference. First operand 108 states and 165 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:02,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:14:02,107 INFO L93 Difference]: Finished difference Result 323 states and 494 transitions. [2024-10-14 11:14:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:14:02,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-10-14 11:14:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:14:02,112 INFO L225 Difference]: With dead ends: 323 [2024-10-14 11:14:02,112 INFO L226 Difference]: Without dead ends: 216 [2024-10-14 11:14:02,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-14 11:14:02,117 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 132 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:14:02,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 469 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:14:02,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-14 11:14:02,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 193. [2024-10-14 11:14:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 138 states have internal predecessors, (194), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 11:14:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 298 transitions. [2024-10-14 11:14:02,163 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 298 transitions. Word has length 177 [2024-10-14 11:14:02,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:14:02,166 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 298 transitions. [2024-10-14 11:14:02,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 298 transitions. [2024-10-14 11:14:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-14 11:14:02,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:14:02,170 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:14:02,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:14:02,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:14:02,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:14:02,171 INFO L85 PathProgramCache]: Analyzing trace with hash -954377203, now seen corresponding path program 1 times [2024-10-14 11:14:02,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:14:02,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984803326] [2024-10-14 11:14:02,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:14:02,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:14:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:14:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:14:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:14:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:14:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:14:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:14:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:14:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:14:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:14:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:14:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:14:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:14:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:14:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:14:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:14:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:14:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:14:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 11:14:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 11:14:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 11:14:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 11:14:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:14:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 11:14:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:14:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 11:14:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:14:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 11:14:02,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:14:02,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984803326] [2024-10-14 11:14:02,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984803326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:14:02,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:14:02,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:14:02,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692153304] [2024-10-14 11:14:02,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:14:02,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:14:02,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:14:02,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:14:02,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:14:02,536 INFO L87 Difference]: Start difference. First operand 193 states and 298 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:14:02,604 INFO L93 Difference]: Finished difference Result 452 states and 699 transitions. [2024-10-14 11:14:02,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:14:02,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 179 [2024-10-14 11:14:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:14:02,609 INFO L225 Difference]: With dead ends: 452 [2024-10-14 11:14:02,609 INFO L226 Difference]: Without dead ends: 324 [2024-10-14 11:14:02,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-14 11:14:02,611 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 159 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:14:02,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 405 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:14:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-14 11:14:02,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 197. [2024-10-14 11:14:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 142 states have (on average 1.3943661971830985) internal successors, (198), 142 states have internal predecessors, (198), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 11:14:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 302 transitions. [2024-10-14 11:14:02,657 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 302 transitions. Word has length 179 [2024-10-14 11:14:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:14:02,659 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 302 transitions. [2024-10-14 11:14:02,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:02,660 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 302 transitions. [2024-10-14 11:14:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-14 11:14:02,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:14:02,665 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:14:02,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:14:02,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:14:02,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:14:02,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1006064093, now seen corresponding path program 1 times [2024-10-14 11:14:02,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:14:02,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771238181] [2024-10-14 11:14:02,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:14:02,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:14:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:14:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:14:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:14:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:14:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:14:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:14:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:14:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:14:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:02,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:14:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:14:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:14:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:14:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:14:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:14:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:14:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:14:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:14:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 11:14:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 11:14:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 11:14:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 11:14:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:14:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 11:14:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:14:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 11:14:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:14:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 11:14:03,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:14:03,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771238181] [2024-10-14 11:14:03,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771238181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:14:03,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:14:03,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:14:03,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055407962] [2024-10-14 11:14:03,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:14:03,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:14:03,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:14:03,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:14:03,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:14:03,082 INFO L87 Difference]: Start difference. First operand 197 states and 302 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:14:03,260 INFO L93 Difference]: Finished difference Result 516 states and 791 transitions. [2024-10-14 11:14:03,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:14:03,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2024-10-14 11:14:03,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:14:03,264 INFO L225 Difference]: With dead ends: 516 [2024-10-14 11:14:03,264 INFO L226 Difference]: Without dead ends: 371 [2024-10-14 11:14:03,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-14 11:14:03,266 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 200 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:14:03,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 525 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:14:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-14 11:14:03,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 347. [2024-10-14 11:14:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 265 states have (on average 1.4264150943396225) internal successors, (378), 265 states have internal predecessors, (378), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-14 11:14:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 534 transitions. [2024-10-14 11:14:03,303 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 534 transitions. Word has length 180 [2024-10-14 11:14:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:14:03,304 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 534 transitions. [2024-10-14 11:14:03,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 534 transitions. [2024-10-14 11:14:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-14 11:14:03,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:14:03,309 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:14:03,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:14:03,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:14:03,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:14:03,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1704119206, now seen corresponding path program 1 times [2024-10-14 11:14:03,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:14:03,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89136464] [2024-10-14 11:14:03,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:14:03,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:14:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:14:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:14:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:14:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:14:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:14:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:14:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:14:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:14:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:14:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:14:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:14:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:14:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:14:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:14:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:14:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:14:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:14:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 11:14:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 11:14:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 11:14:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 11:14:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:14:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 11:14:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:14:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 11:14:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:14:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 11:14:03,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:14:03,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89136464] [2024-10-14 11:14:03,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89136464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:14:03,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:14:03,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 11:14:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013462530] [2024-10-14 11:14:03,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:14:03,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:14:03,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:14:03,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:14:03,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:14:03,824 INFO L87 Difference]: Start difference. First operand 347 states and 534 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:14:04,120 INFO L93 Difference]: Finished difference Result 775 states and 1178 transitions. [2024-10-14 11:14:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 11:14:04,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 182 [2024-10-14 11:14:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:14:04,125 INFO L225 Difference]: With dead ends: 775 [2024-10-14 11:14:04,125 INFO L226 Difference]: Without dead ends: 485 [2024-10-14 11:14:04,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:14:04,127 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 194 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:14:04,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 684 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:14:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-14 11:14:04,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 429. [2024-10-14 11:14:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 347 states have (on average 1.440922190201729) internal successors, (500), 347 states have internal predecessors, (500), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-14 11:14:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 656 transitions. [2024-10-14 11:14:04,165 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 656 transitions. Word has length 182 [2024-10-14 11:14:04,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:14:04,165 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 656 transitions. [2024-10-14 11:14:04,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 656 transitions. [2024-10-14 11:14:04,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-14 11:14:04,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:14:04,168 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:14:04,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 11:14:04,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:14:04,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:14:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1726751460, now seen corresponding path program 1 times [2024-10-14 11:14:04,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:14:04,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841341573] [2024-10-14 11:14:04,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:14:04,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:14:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:14:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:14:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:14:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:14:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:14:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:14:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:14:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:14:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:14:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:14:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:14:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:14:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:14:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:14:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:14:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:14:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:14:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 11:14:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 11:14:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 11:14:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 11:14:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:14:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 11:14:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:14:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 11:14:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:14:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 11:14:04,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:14:04,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841341573] [2024-10-14 11:14:04,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841341573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:14:04,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:14:04,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:14:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116999631] [2024-10-14 11:14:04,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:14:04,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:14:04,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:14:04,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:14:04,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:14:04,842 INFO L87 Difference]: Start difference. First operand 429 states and 656 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:05,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:14:05,141 INFO L93 Difference]: Finished difference Result 683 states and 1040 transitions. [2024-10-14 11:14:05,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:14:05,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 182 [2024-10-14 11:14:05,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:14:05,145 INFO L225 Difference]: With dead ends: 683 [2024-10-14 11:14:05,146 INFO L226 Difference]: Without dead ends: 393 [2024-10-14 11:14:05,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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-14 11:14:05,150 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 118 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:14:05,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 449 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:14:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-14 11:14:05,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 375. [2024-10-14 11:14:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 293 states have (on average 1.4095563139931742) internal successors, (413), 293 states have internal predecessors, (413), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-14 11:14:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 569 transitions. [2024-10-14 11:14:05,197 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 569 transitions. Word has length 182 [2024-10-14 11:14:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:14:05,198 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 569 transitions. [2024-10-14 11:14:05,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 569 transitions. [2024-10-14 11:14:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-14 11:14:05,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:14:05,201 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:14:05,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 11:14:05,202 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:14:05,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:14:05,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1741486616, now seen corresponding path program 1 times [2024-10-14 11:14:05,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:14:05,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065481737] [2024-10-14 11:14:05,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:14:05,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:14:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:14:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:14:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:14:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:14:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:14:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:14:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:14:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:14:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:14:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:14:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:14:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:14:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:14:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:14:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:14:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:14:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:14:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 11:14:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 11:14:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 11:14:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 11:14:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:14:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 11:14:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:14:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 11:14:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:14:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 11:14:05,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:14:05,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065481737] [2024-10-14 11:14:05,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065481737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:14:05,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:14:05,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 11:14:05,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462158564] [2024-10-14 11:14:05,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:14:05,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:14:05,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:14:05,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:14:05,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:14:05,656 INFO L87 Difference]: Start difference. First operand 375 states and 569 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:14:05,875 INFO L93 Difference]: Finished difference Result 721 states and 1088 transitions. [2024-10-14 11:14:05,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 11:14:05,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 183 [2024-10-14 11:14:05,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:14:05,879 INFO L225 Difference]: With dead ends: 721 [2024-10-14 11:14:05,879 INFO L226 Difference]: Without dead ends: 399 [2024-10-14 11:14:05,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:14:05,881 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 196 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:14:05,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 738 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:14:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-14 11:14:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 375. [2024-10-14 11:14:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 293 states have (on average 1.4027303754266212) internal successors, (411), 293 states have internal predecessors, (411), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-14 11:14:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 567 transitions. [2024-10-14 11:14:05,921 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 567 transitions. Word has length 183 [2024-10-14 11:14:05,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:14:05,923 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 567 transitions. [2024-10-14 11:14:05,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 567 transitions. [2024-10-14 11:14:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-14 11:14:05,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:14:05,928 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:14:05,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 11:14:05,929 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:14:05,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:14:05,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1039886742, now seen corresponding path program 1 times [2024-10-14 11:14:05,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:14:05,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048109303] [2024-10-14 11:14:05,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:14:05,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:14:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:14:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:14:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:14:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:14:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:14:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:14:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:14:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:14:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:14:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:14:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:14:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:14:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:14:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:14:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:14:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:14:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:14:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 11:14:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 11:14:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 11:14:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 11:14:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:14:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 11:14:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:14:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 11:14:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:14:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 11:14:06,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:14:06,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048109303] [2024-10-14 11:14:06,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048109303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:14:06,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:14:06,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:14:06,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008179155] [2024-10-14 11:14:06,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:14:06,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:14:06,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:14:06,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:14:06,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:14:06,420 INFO L87 Difference]: Start difference. First operand 375 states and 567 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:14:06,663 INFO L93 Difference]: Finished difference Result 709 states and 1070 transitions. [2024-10-14 11:14:06,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:14:06,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 183 [2024-10-14 11:14:06,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:14:06,667 INFO L225 Difference]: With dead ends: 709 [2024-10-14 11:14:06,667 INFO L226 Difference]: Without dead ends: 391 [2024-10-14 11:14:06,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-14 11:14:06,669 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 112 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:14:06,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 453 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:14:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-14 11:14:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 377. [2024-10-14 11:14:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 295 states have (on average 1.3966101694915254) internal successors, (412), 295 states have internal predecessors, (412), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-14 11:14:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 568 transitions. [2024-10-14 11:14:06,713 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 568 transitions. Word has length 183 [2024-10-14 11:14:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:14:06,717 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 568 transitions. [2024-10-14 11:14:06,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 568 transitions. [2024-10-14 11:14:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-14 11:14:06,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:14:06,720 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:14:06,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 11:14:06,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:14:06,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:14:06,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1670534719, now seen corresponding path program 1 times [2024-10-14 11:14:06,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:14:06,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609454879] [2024-10-14 11:14:06,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:14:06,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:14:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:14:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:14:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:14:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:14:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:14:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:14:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:14:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:14:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:14:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:14:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:14:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:14:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:14:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:14:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:14:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:14:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:14:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 11:14:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 11:14:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 11:14:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 11:14:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:14:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 11:14:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:14:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 11:14:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:14:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 11:14:07,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:14:07,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609454879] [2024-10-14 11:14:07,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609454879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:14:07,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:14:07,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 11:14:07,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477929094] [2024-10-14 11:14:07,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:14:07,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 11:14:07,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:14:07,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 11:14:07,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:14:07,288 INFO L87 Difference]: Start difference. First operand 377 states and 568 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 11:14:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:14:07,617 INFO L93 Difference]: Finished difference Result 697 states and 1045 transitions. [2024-10-14 11:14:07,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:14:07,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 184 [2024-10-14 11:14:07,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:14:07,620 INFO L225 Difference]: With dead ends: 697 [2024-10-14 11:14:07,620 INFO L226 Difference]: Without dead ends: 389 [2024-10-14 11:14:07,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:14:07,622 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 230 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:14:07,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 733 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:14:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-14 11:14:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 375. [2024-10-14 11:14:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 293 states have (on average 1.3686006825938566) internal successors, (401), 293 states have internal predecessors, (401), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-14 11:14:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 557 transitions. [2024-10-14 11:14:07,664 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 557 transitions. Word has length 184 [2024-10-14 11:14:07,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:14:07,664 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 557 transitions. [2024-10-14 11:14:07,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 11:14:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 557 transitions. [2024-10-14 11:14:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-14 11:14:07,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:14:07,666 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:14:07,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 11:14:07,667 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:14:07,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:14:07,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1052989697, now seen corresponding path program 1 times [2024-10-14 11:14:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:14:07,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678771851] [2024-10-14 11:14:07,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:14:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:14:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:14:07,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:14:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:14:08,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:14:08,015 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:14:08,016 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:14:08,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 11:14:08,021 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:14:08,162 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:14:08,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:14:08 BoogieIcfgContainer [2024-10-14 11:14:08,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:14:08,166 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:14:08,166 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:14:08,167 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:14:08,167 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:14:00" (3/4) ... [2024-10-14 11:14:08,169 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:14:08,170 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:14:08,171 INFO L158 Benchmark]: Toolchain (without parser) took 9186.75ms. Allocated memory was 186.6MB in the beginning and 274.7MB in the end (delta: 88.1MB). Free memory was 131.5MB in the beginning and 106.8MB in the end (delta: 24.7MB). Peak memory consumption was 113.4MB. Max. memory is 16.1GB. [2024-10-14 11:14:08,171 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 96.5MB. Free memory was 51.6MB in the beginning and 51.5MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:14:08,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.36ms. Allocated memory is still 186.6MB. Free memory was 131.1MB in the beginning and 154.2MB in the end (delta: -23.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 11:14:08,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.27ms. Allocated memory is still 186.6MB. Free memory was 154.2MB in the beginning and 147.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 11:14:08,172 INFO L158 Benchmark]: Boogie Preprocessor took 116.81ms. Allocated memory is still 186.6MB. Free memory was 147.9MB in the beginning and 141.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 11:14:08,172 INFO L158 Benchmark]: RCFGBuilder took 783.72ms. Allocated memory is still 186.6MB. Free memory was 141.6MB in the beginning and 101.8MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-14 11:14:08,172 INFO L158 Benchmark]: TraceAbstraction took 7751.41ms. Allocated memory was 186.6MB in the beginning and 274.7MB in the end (delta: 88.1MB). Free memory was 100.7MB in the beginning and 107.9MB in the end (delta: -7.2MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. [2024-10-14 11:14:08,173 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 274.7MB. Free memory was 107.9MB in the beginning and 106.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:14:08,174 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.63ms. Allocated memory is still 96.5MB. Free memory was 51.6MB in the beginning and 51.5MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.36ms. Allocated memory is still 186.6MB. Free memory was 131.1MB in the beginning and 154.2MB in the end (delta: -23.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.27ms. Allocated memory is still 186.6MB. Free memory was 154.2MB in the beginning and 147.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.81ms. Allocated memory is still 186.6MB. Free memory was 147.9MB in the beginning and 141.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 783.72ms. Allocated memory is still 186.6MB. Free memory was 141.6MB in the beginning and 101.8MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7751.41ms. Allocated memory was 186.6MB in the beginning and 274.7MB in the end (delta: 88.1MB). Free memory was 100.7MB in the beginning and 107.9MB in the end (delta: -7.2MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 274.7MB. Free memory was 107.9MB in the beginning and 106.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 155, overapproximation of bitwiseOr at line 64, overapproximation of bitwiseAnd at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 200. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 10; [L24] unsigned char var_1_5 = 4; [L25] unsigned char var_1_6 = 1; [L26] float var_1_7 = 127.25; [L27] float var_1_8 = 128.5; [L28] unsigned char var_1_11 = 0; [L29] unsigned char var_1_12 = 0; [L30] signed long int var_1_13 = -10; [L31] unsigned char var_1_14 = 1; [L32] signed char var_1_16 = -1; [L33] signed char var_1_17 = -5; [L34] signed char var_1_18 = 2; [L35] double var_1_19 = 256.7; [L36] double var_1_20 = 256.5; [L37] double var_1_21 = 5.058; [L38] double var_1_22 = 2.4; [L39] double var_1_23 = 5.875; [L40] signed long int var_1_24 = -128; [L41] unsigned long int var_1_25 = 128; [L42] unsigned char var_1_26 = 128; [L43] unsigned long int var_1_27 = 4189380979; [L44] unsigned char var_1_28 = 0; [L45] unsigned char var_1_29 = 0; [L46] unsigned long int var_1_30 = 2; [L47] unsigned long int var_1_31 = 1701266831; [L48] unsigned long int var_1_32 = 1169870883; [L49] double var_1_33 = 4.3; [L50] double var_1_34 = 7.25; [L51] unsigned short int var_1_35 = 32; [L52] unsigned char last_1_var_1_1 = 1; [L53] unsigned char last_1_var_1_6 = 1; [L54] signed char last_1_var_1_16 = -1; [L55] double last_1_var_1_19 = 256.7; [L56] signed long int last_1_var_1_24 = -128; [L57] unsigned long int last_1_var_1_25 = 128; [L58] unsigned long int last_1_var_1_30 = 2; [L59] double last_1_var_1_33 = 4.3; [L204] isInitial = 1 [L205] FCALL initially() [L206] int k_loop; [L207] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=10, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L207] COND TRUE k_loop < 1 [L208] CALL updateLastVariables() [L190] last_1_var_1_1 = var_1_1 [L191] last_1_var_1_6 = var_1_6 [L192] last_1_var_1_16 = var_1_16 [L193] last_1_var_1_19 = var_1_19 [L194] last_1_var_1_24 = var_1_24 [L195] last_1_var_1_25 = var_1_25 [L196] last_1_var_1_30 = var_1_30 [L197] last_1_var_1_33 = var_1_33 [L208] RET updateLastVariables() [L209] CALL updateVariables() [L146] var_1_4 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L147] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=4, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L149] var_1_5 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L150] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L151] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L151] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1, var_1_7=509/4, var_1_8=257/2] [L152] var_1_7 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427387900e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1, var_1_8=257/2] [L153] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427387900e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1, var_1_8=257/2] [L154] var_1_8 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L155] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L156] var_1_11 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L157] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L158] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L158] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L159] var_1_12 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L160] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L161] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L161] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=-5, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L162] var_1_17 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L163] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L164] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L164] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=2, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L165] var_1_18 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L166] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L167] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L167] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=513/2, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L168] var_1_20 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L169] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_21=2529/500, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L170] var_1_21 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L171] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_22=12/5, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L172] var_1_22 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L173] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_23=47/8, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L174] var_1_23 = __VERIFIER_nondet_double() [L175] CALL assume_abort_if_not((var_1_23 >= -230584.3009213691390e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 2305843.009213691390e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L175] RET assume_abort_if_not((var_1_23 >= -230584.3009213691390e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 2305843.009213691390e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=4189380979, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L176] var_1_27 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_27 >= 3221225471) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L177] RET assume_abort_if_not(var_1_27 >= 3221225471) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L178] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L178] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=0, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L179] var_1_29 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L180] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L181] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L181] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=1701266831, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L182] var_1_31 = __VERIFIER_nondet_ulong() [L183] CALL assume_abort_if_not(var_1_31 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L183] RET assume_abort_if_not(var_1_31 >= 1073741823) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L184] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L184] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=1169870883, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L185] var_1_32 = __VERIFIER_nondet_ulong() [L186] CALL assume_abort_if_not(var_1_32 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L186] RET assume_abort_if_not(var_1_32 >= 1073741824) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L187] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L187] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L209] RET updateVariables() [L210] CALL step() [L63] COND TRUE last_1_var_1_6 || last_1_var_1_6 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L64] EXPR last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L64] COND FALSE !((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) [L68] unsigned long int stepLocal_6 = (var_1_27 - last_1_var_1_1) - var_1_4; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_6=-5368709248, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L69] EXPR last_1_var_1_30 & last_1_var_1_25 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_6=-5368709248, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=128, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L69] COND TRUE stepLocal_6 > (last_1_var_1_30 & last_1_var_1_25) [L70] var_1_26 = (var_1_4 + 4) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L74] COND TRUE last_1_var_1_33 > last_1_var_1_33 [L75] var_1_28 = (! ((var_1_4 != last_1_var_1_24) || var_1_29)) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_24=-128, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=2, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=43/10, var_1_34=29/4, var_1_35=32, var_1_4=126, var_1_5=989488257, var_1_6=1] [L77] var_1_30 = ((((((var_1_31 + var_1_32)) < ((3305479224u - var_1_5))) ? ((var_1_31 + var_1_32)) : ((3305479224u - var_1_5)))) - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) [L78] var_1_33 = var_1_20 [L79] var_1_34 = var_1_22 [L80] var_1_35 = var_1_30 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450949, var_1_22=6442450948, var_1_24=-128, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=1] [L81] COND FALSE !(((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) [L88] var_1_6 = 0 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450949, var_1_22=6442450948, var_1_24=-128, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L90] unsigned char stepLocal_2 = var_1_14; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_2=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450949, var_1_22=6442450948, var_1_24=-128, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L91] COND FALSE !(stepLocal_2 && var_1_6) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450949, var_1_22=6442450948, var_1_24=-128, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L94] COND FALSE !(\read(var_1_28)) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450949, var_1_22=6442450948, var_1_24=-128, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L98] COND FALSE !(var_1_18 <= (~ var_1_4)) [L105] var_1_24 = var_1_18 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L107] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_0=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=1, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L108] COND FALSE !(var_1_28 && stepLocal_0) [L111] var_1_1 = ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L113] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=989488257, var_1_11=0, var_1_12=0, var_1_13=-10, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L114] COND FALSE !(var_1_7 > var_1_33) [L121] var_1_13 = var_1_4 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=989488257, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L123] signed char stepLocal_3 = var_1_18; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=989488257, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L124] COND FALSE !((var_1_16 ^ 1) >= stepLocal_3) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=989488257, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L133] signed long int stepLocal_5 = var_1_13; VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=989488257, stepLocal_5=126, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L134] EXPR var_1_24 | var_1_35 VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=989488257, stepLocal_5=126, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=128, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L134] signed long int stepLocal_4 = var_1_24 | var_1_35; [L135] COND TRUE (10000 / 64) >= stepLocal_4 [L136] var_1_25 = ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, stepLocal_1=989488257, stepLocal_5=126, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=129, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L210] RET step() [L211] CALL, EXPR property() [L200] EXPR ((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=129, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L200] EXPR ((((((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1)) && ((var_1_14 && var_1_6) ? (var_1_16 == ((signed char) (((((var_1_17 + var_1_18)) < (-5)) ? ((var_1_17 + var_1_18)) : (-5))))) : (var_1_28 ? (var_1_16 == ((signed char) var_1_17)) : 1))) && (((var_1_16 ^ 1) >= var_1_18) ? (var_1_28 ? ((var_1_8 <= ((((var_1_33) > (last_1_var_1_19)) ? (var_1_33) : (last_1_var_1_19)))) ? (var_1_19 == ((double) ((((var_1_7) > (((var_1_20 + var_1_21) + (var_1_22 + var_1_23)))) ? (var_1_7) : (((var_1_20 + var_1_21) + (var_1_22 + var_1_23))))))) : (var_1_19 == ((double) var_1_21))) : 1) : 1)) && ((var_1_18 <= (~ var_1_4)) ? (var_1_28 ? (var_1_24 == ((signed long int) ((((256) < (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5)))))) ? (256) : (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5))))))))) : (var_1_24 == ((signed long int) -5))) : (var_1_24 == ((signed long int) var_1_18)))) && (((10000 / 64) >= (var_1_24 | var_1_35)) ? (var_1_25 == ((unsigned long int) ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))))) : ((var_1_13 < ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) ? (var_1_25 == ((unsigned long int) var_1_26)) : (var_1_25 == ((unsigned long int) var_1_26)))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=129, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L200] EXPR (((((((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1)) && ((var_1_14 && var_1_6) ? (var_1_16 == ((signed char) (((((var_1_17 + var_1_18)) < (-5)) ? ((var_1_17 + var_1_18)) : (-5))))) : (var_1_28 ? (var_1_16 == ((signed char) var_1_17)) : 1))) && (((var_1_16 ^ 1) >= var_1_18) ? (var_1_28 ? ((var_1_8 <= ((((var_1_33) > (last_1_var_1_19)) ? (var_1_33) : (last_1_var_1_19)))) ? (var_1_19 == ((double) ((((var_1_7) > (((var_1_20 + var_1_21) + (var_1_22 + var_1_23)))) ? (var_1_7) : (((var_1_20 + var_1_21) + (var_1_22 + var_1_23))))))) : (var_1_19 == ((double) var_1_21))) : 1) : 1)) && ((var_1_18 <= (~ var_1_4)) ? (var_1_28 ? (var_1_24 == ((signed long int) ((((256) < (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5)))))) ? (256) : (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5))))))))) : (var_1_24 == ((signed long int) -5))) : (var_1_24 == ((signed long int) var_1_18)))) && (((10000 / 64) >= (var_1_24 | var_1_35)) ? (var_1_25 == ((unsigned long int) ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))))) : ((var_1_13 < ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) ? (var_1_25 == ((unsigned long int) var_1_26)) : (var_1_25 == ((unsigned long int) var_1_26))))) && ((((var_1_27 - last_1_var_1_1) - var_1_4) > (last_1_var_1_30 & last_1_var_1_25)) ? (var_1_26 == ((unsigned char) (var_1_4 + 4))) : (var_1_26 == ((unsigned char) (4 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=129, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L200-L201] return ((((((((((((((var_1_28 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + 5))) : (var_1_1 == ((unsigned char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) && ((((var_1_7 + 100000.5f) - var_1_8) > (var_1_33 + var_1_34)) ? ((var_1_8 > var_1_33) ? (var_1_6 == ((unsigned char) (var_1_11 || var_1_12))) : (var_1_6 == ((unsigned char) var_1_11))) : (var_1_6 == ((unsigned char) 0)))) && ((var_1_7 > var_1_33) ? ((var_1_5 < var_1_26) ? (var_1_13 == ((signed long int) (var_1_4 - 1))) : (var_1_13 == ((signed long int) var_1_5))) : (var_1_13 == ((signed long int) var_1_4)))) && ((last_1_var_1_6 || last_1_var_1_6) ? (((last_1_var_1_16 | ((((var_1_5) > (128)) ? (var_1_5) : (128)))) < last_1_var_1_25) ? (var_1_14 == ((unsigned char) (var_1_11 || var_1_12))) : 1) : 1)) && ((var_1_14 && var_1_6) ? (var_1_16 == ((signed char) (((((var_1_17 + var_1_18)) < (-5)) ? ((var_1_17 + var_1_18)) : (-5))))) : (var_1_28 ? (var_1_16 == ((signed char) var_1_17)) : 1))) && (((var_1_16 ^ 1) >= var_1_18) ? (var_1_28 ? ((var_1_8 <= ((((var_1_33) > (last_1_var_1_19)) ? (var_1_33) : (last_1_var_1_19)))) ? (var_1_19 == ((double) ((((var_1_7) > (((var_1_20 + var_1_21) + (var_1_22 + var_1_23)))) ? (var_1_7) : (((var_1_20 + var_1_21) + (var_1_22 + var_1_23))))))) : (var_1_19 == ((double) var_1_21))) : 1) : 1)) && ((var_1_18 <= (~ var_1_4)) ? (var_1_28 ? (var_1_24 == ((signed long int) ((((256) < (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5)))))) ? (256) : (((var_1_26 + var_1_18) + ((((last_1_var_1_24) < (var_1_5)) ? (last_1_var_1_24) : (var_1_5))))))))) : (var_1_24 == ((signed long int) -5))) : (var_1_24 == ((signed long int) var_1_18)))) && (((10000 / 64) >= (var_1_24 | var_1_35)) ? (var_1_25 == ((unsigned long int) ((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4))))) : ((var_1_13 < ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))) ? (var_1_25 == ((unsigned long int) var_1_26)) : (var_1_25 == ((unsigned long int) var_1_26))))) && ((((var_1_27 - last_1_var_1_1) - var_1_4) > (last_1_var_1_30 & last_1_var_1_25)) ? (var_1_26 == ((unsigned char) (var_1_4 + 4))) : (var_1_26 == ((unsigned char) (4 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) && ((last_1_var_1_33 > last_1_var_1_33) ? (var_1_28 == ((unsigned char) (! ((var_1_4 != last_1_var_1_24) || var_1_29)))) : 1)) && (var_1_30 == ((unsigned long int) ((((((var_1_31 + var_1_32)) < ((3305479224u - var_1_5))) ? ((var_1_31 + var_1_32)) : ((3305479224u - var_1_5)))) - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))))) && (var_1_33 == ((double) var_1_20))) && (var_1_34 == ((double) var_1_22))) && (var_1_35 == ((unsigned short int) var_1_30)) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=129, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=-1, last_1_var_1_19=2567/10, last_1_var_1_1=1, last_1_var_1_24=-128, last_1_var_1_25=128, last_1_var_1_30=2, last_1_var_1_33=43/10, last_1_var_1_6=1, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=1, var_1_16=-1, var_1_17=63, var_1_18=0, var_1_19=2567/10, var_1_1=129, var_1_20=6442450949, var_1_22=6442450948, var_1_24=0, var_1_25=129, var_1_26=130, var_1_27=-5368709121, var_1_28=0, var_1_29=1, var_1_30=3305439233, var_1_31=6442450943, var_1_32=-3137011584, var_1_33=6442450949, var_1_34=6442450948, var_1_35=3305439233, var_1_4=126, var_1_5=989488257, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 10, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1341 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1341 mSDsluCounter, 4618 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2939 mSDsCounter, 641 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 426 IncrementalHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 641 mSolverCounterUnsat, 1679 mSDtfsCounter, 426 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 544 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 300 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1811 NumberOfCodeBlocks, 1811 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1618 ConstructedInterpolants, 0 QuantifiedInterpolants, 5277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 11700/11700 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-14 11:14:08,212 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_100-1loop_file-43.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 7e66f2766686731553c198a13682fe7d31c9aeab700c26b7283920d0b82d9f8b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:14:10,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:14:10,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:14:10,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:14:10,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:14:10,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:14:10,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:14:10,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:14:10,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:14:10,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:14:10,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:14:10,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:14:10,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:14:10,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:14:10,661 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:14:10,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:14:10,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:14:10,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:14:10,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:14:10,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:14:10,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:14:10,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:14:10,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:14:10,664 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:14:10,664 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:14:10,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:14:10,665 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:14:10,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:14:10,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:14:10,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:14:10,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:14:10,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:14:10,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:14:10,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:14:10,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:14:10,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:14:10,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:14:10,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:14:10,668 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:14:10,669 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:14:10,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:14:10,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:14:10,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:14:10,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:14:10,670 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:14:10,670 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 -> 7e66f2766686731553c198a13682fe7d31c9aeab700c26b7283920d0b82d9f8b [2024-10-14 11:14:11,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:14:11,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:14:11,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:14:11,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:14:11,054 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:14:11,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-43.i [2024-10-14 11:14:12,633 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:14:12,890 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:14:12,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-43.i [2024-10-14 11:14:12,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df387b086/cb0e23132a694dca918c7f43b3132301/FLAG356845e29 [2024-10-14 11:14:13,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df387b086/cb0e23132a694dca918c7f43b3132301 [2024-10-14 11:14:13,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:14:13,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:14:13,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:14:13,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:14:13,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:14:13,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:14:13" (1/1) ... [2024-10-14 11:14:13,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12830eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13, skipping insertion in model container [2024-10-14 11:14:13,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:14:13" (1/1) ... [2024-10-14 11:14:13,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:14:13,453 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_100-1loop_file-43.i[916,929] [2024-10-14 11:14:13,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:14:13,586 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:14:13,599 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_100-1loop_file-43.i[916,929] [2024-10-14 11:14:13,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:14:13,709 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:14:13,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13 WrapperNode [2024-10-14 11:14:13,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:14:13,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:14:13,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:14:13,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:14:13,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13" (1/1) ... [2024-10-14 11:14:13,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13" (1/1) ... [2024-10-14 11:14:13,780 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-10-14 11:14:13,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:14:13,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:14:13,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:14:13,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:14:13,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13" (1/1) ... [2024-10-14 11:14:13,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13" (1/1) ... [2024-10-14 11:14:13,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13" (1/1) ... [2024-10-14 11:14:13,829 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-14 11:14:13,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13" (1/1) ... [2024-10-14 11:14:13,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13" (1/1) ... [2024-10-14 11:14:13,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13" (1/1) ... [2024-10-14 11:14:13,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13" (1/1) ... [2024-10-14 11:14:13,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13" (1/1) ... [2024-10-14 11:14:13,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13" (1/1) ... [2024-10-14 11:14:13,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:14:13,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:14:13,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:14:13,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:14:13,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13" (1/1) ... [2024-10-14 11:14:13,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:14:13,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:14:13,894 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-14 11:14:13,896 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-14 11:14:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:14:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:14:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:14:13,936 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:14:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:14:13,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:14:14,028 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:14:14,030 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:14:24,373 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-14 11:14:24,374 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:14:24,440 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:14:24,441 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:14:24,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:14:24 BoogieIcfgContainer [2024-10-14 11:14:24,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:14:24,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:14:24,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:14:24,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:14:24,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:14:13" (1/3) ... [2024-10-14 11:14:24,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431786bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:14:24, skipping insertion in model container [2024-10-14 11:14:24,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:13" (2/3) ... [2024-10-14 11:14:24,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431786bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:14:24, skipping insertion in model container [2024-10-14 11:14:24,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:14:24" (3/3) ... [2024-10-14 11:14:24,452 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-43.i [2024-10-14 11:14:24,471 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:14:24,489 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:14:24,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:14:24,573 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;@2d0caac3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:14:24,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:14:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 11:14:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-14 11:14:24,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:14:24,597 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:14:24,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:14:24,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:14:24,603 INFO L85 PathProgramCache]: Analyzing trace with hash 279280051, now seen corresponding path program 1 times [2024-10-14 11:14:24,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:14:24,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288551220] [2024-10-14 11:14:24,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:14:24,617 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-14 11:14:24,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:14:24,621 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-14 11:14:24,641 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-14 11:14:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:25,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:14:25,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:14:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-10-14 11:14:25,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:14:25,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:14:25,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288551220] [2024-10-14 11:14:25,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288551220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:14:25,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:14:25,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:14:25,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444259073] [2024-10-14 11:14:25,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:14:25,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:14:25,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:14:25,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:14:25,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:14:25,315 INFO L87 Difference]: Start difference. First operand has 80 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 11:14:29,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:14:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:14:29,600 INFO L93 Difference]: Finished difference Result 159 states and 277 transitions. [2024-10-14 11:14:29,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:14:29,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2024-10-14 11:14:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:14:29,610 INFO L225 Difference]: With dead ends: 159 [2024-10-14 11:14:29,611 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 11:14:29,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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-14 11:14:29,618 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:14:29,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 11:14:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 11:14:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 11:14:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 11:14:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2024-10-14 11:14:29,683 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 168 [2024-10-14 11:14:29,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:14:29,686 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2024-10-14 11:14:29,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 11:14:29,687 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2024-10-14 11:14:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-14 11:14:29,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:14:29,694 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:14:29,717 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-14 11:14:29,895 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-14 11:14:29,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:14:29,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:14:29,896 INFO L85 PathProgramCache]: Analyzing trace with hash -404731225, now seen corresponding path program 1 times [2024-10-14 11:14:29,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:14:29,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110068220] [2024-10-14 11:14:29,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:14:29,898 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-14 11:14:29,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:14:29,899 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-14 11:14:29,902 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-14 11:14:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:30,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 11:14:30,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:14:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 11:14:32,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:14:32,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:14:32,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110068220] [2024-10-14 11:14:32,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110068220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:14:32,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:14:32,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:14:32,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851940030] [2024-10-14 11:14:32,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:14:32,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:14:32,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:14:32,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:14:32,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:14:32,723 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:36,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:14:40,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:14:44,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:14:49,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:14:53,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:14:56,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:14:56,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:14:56,932 INFO L93 Difference]: Finished difference Result 233 states and 359 transitions. [2024-10-14 11:14:56,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:14:56,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-10-14 11:14:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:14:56,938 INFO L225 Difference]: With dead ends: 233 [2024-10-14 11:14:56,938 INFO L226 Difference]: Without dead ends: 156 [2024-10-14 11:14:56,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:14:56,940 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 75 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 53 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:14:56,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 340 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 16 Invalid, 4 Unknown, 0 Unchecked, 24.1s Time] [2024-10-14 11:14:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-14 11:14:56,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 126. [2024-10-14 11:14:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 11:14:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 193 transitions. [2024-10-14 11:14:56,983 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 193 transitions. Word has length 168 [2024-10-14 11:14:56,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:14:56,984 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 193 transitions. [2024-10-14 11:14:56,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:14:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 193 transitions. [2024-10-14 11:14:56,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 11:14:56,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:14:56,988 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:14:57,008 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-14 11:14:57,191 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-14 11:14:57,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:14:57,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:14:57,192 INFO L85 PathProgramCache]: Analyzing trace with hash -418055870, now seen corresponding path program 1 times [2024-10-14 11:14:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:14:57,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179785170] [2024-10-14 11:14:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:14:57,193 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-14 11:14:57,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:14:57,196 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-14 11:14:57,197 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-14 11:14:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:14:57,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 11:14:57,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:14:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 11:14:57,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:14:57,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:14:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179785170] [2024-10-14 11:14:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179785170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:14:57,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:14:57,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:14:57,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422767362] [2024-10-14 11:14:57,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:14:57,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:14:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:14:57,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:14:57,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:14:57,673 INFO L87 Difference]: Start difference. First operand 126 states and 193 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:15:02,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:15:06,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:15:09,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:15:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:15:09,683 INFO L93 Difference]: Finished difference Result 280 states and 431 transitions. [2024-10-14 11:15:09,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:15:09,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-10-14 11:15:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:15:09,693 INFO L225 Difference]: With dead ends: 280 [2024-10-14 11:15:09,693 INFO L226 Difference]: Without dead ends: 203 [2024-10-14 11:15:09,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 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-14 11:15:09,695 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 114 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:15:09,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 337 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 12.0s Time] [2024-10-14 11:15:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-14 11:15:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 128. [2024-10-14 11:15:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 11:15:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 195 transitions. [2024-10-14 11:15:09,724 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 195 transitions. Word has length 169 [2024-10-14 11:15:09,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:15:09,725 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 195 transitions. [2024-10-14 11:15:09,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:15:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 195 transitions. [2024-10-14 11:15:09,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-14 11:15:09,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:15:09,728 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:15:09,749 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 (4)] Ended with exit code 0 [2024-10-14 11:15:09,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:15:09,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:15:09,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:15:09,930 INFO L85 PathProgramCache]: Analyzing trace with hash -877301121, now seen corresponding path program 1 times [2024-10-14 11:15:09,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:15:09,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589249210] [2024-10-14 11:15:09,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:15:09,931 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-14 11:15:09,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:15:09,934 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:15:09,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 11:15:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:15:10,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 11:15:10,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:15:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 629 proven. 99 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2024-10-14 11:15:14,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:15:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 45 proven. 102 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2024-10-14 11:15:16,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:15:16,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589249210] [2024-10-14 11:15:16,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589249210] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:15:16,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 11:15:16,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-14 11:15:16,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991798926] [2024-10-14 11:15:16,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 11:15:16,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 11:15:16,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:15:16,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 11:15:16,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-14 11:15:16,358 INFO L87 Difference]: Start difference. First operand 128 states and 195 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-10-14 11:15:23,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []