./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-69.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 01b73e46276f70692a601510faa80641db7bb7027bfb04cc38bc964dfdc1b93b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:01:36,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:01:36,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:01:36,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:01:36,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:01:36,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:01:36,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:01:36,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:01:36,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:01:36,687 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:01:36,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:01:36,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:01:36,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:01:36,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:01:36,688 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:01:36,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:01:36,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:01:36,688 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:01:36,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:01:36,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:01:36,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:01:36,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:01:36,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:01:36,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:01:36,689 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:01:36,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:01:36,689 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:01:36,689 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:01:36,689 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:01:36,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:01:36,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:01:36,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:01:36,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:01:36,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:01:36,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:01:36,690 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:01:36,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:01:36,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:01:36,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:01:36,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:01:36,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:01:36,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:01:36,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:01:36,691 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 01b73e46276f70692a601510faa80641db7bb7027bfb04cc38bc964dfdc1b93b [2025-03-03 23:01:36,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:01:36,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:01:36,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:01:36,931 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:01:36,932 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:01:36,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-69.i [2025-03-03 23:01:38,047 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b47f3d9/a8ccc7ae3d8e41ec88b09dd0f0b3a6cf/FLAGa9bd9617e [2025-03-03 23:01:38,276 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:01:38,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-69.i [2025-03-03 23:01:38,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b47f3d9/a8ccc7ae3d8e41ec88b09dd0f0b3a6cf/FLAGa9bd9617e [2025-03-03 23:01:38,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b47f3d9/a8ccc7ae3d8e41ec88b09dd0f0b3a6cf [2025-03-03 23:01:38,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:01:38,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:01:38,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:01:38,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:01:38,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:01:38,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:01:38" (1/1) ... [2025-03-03 23:01:38,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d17ba1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38, skipping insertion in model container [2025-03-03 23:01:38,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:01:38" (1/1) ... [2025-03-03 23:01:38,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:01:38,424 WARN L250 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-while_file-69.i[916,929] [2025-03-03 23:01:38,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:01:38,518 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:01:38,526 WARN L250 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-while_file-69.i[916,929] [2025-03-03 23:01:38,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:01:38,564 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:01:38,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38 WrapperNode [2025-03-03 23:01:38,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:01:38,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:01:38,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:01:38,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:01:38,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38" (1/1) ... [2025-03-03 23:01:38,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38" (1/1) ... [2025-03-03 23:01:38,616 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2025-03-03 23:01:38,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:01:38,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:01:38,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:01:38,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:01:38,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38" (1/1) ... [2025-03-03 23:01:38,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38" (1/1) ... [2025-03-03 23:01:38,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38" (1/1) ... [2025-03-03 23:01:38,655 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]. [2025-03-03 23:01:38,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38" (1/1) ... [2025-03-03 23:01:38,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38" (1/1) ... [2025-03-03 23:01:38,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38" (1/1) ... [2025-03-03 23:01:38,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38" (1/1) ... [2025-03-03 23:01:38,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38" (1/1) ... [2025-03-03 23:01:38,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38" (1/1) ... [2025-03-03 23:01:38,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:01:38,682 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:01:38,682 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:01:38,682 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:01:38,683 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38" (1/1) ... [2025-03-03 23:01:38,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:01:38,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:38,709 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) [2025-03-03 23:01:38,712 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 [2025-03-03 23:01:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:01:38,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:01:38,731 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:01:38,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:01:38,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:01:38,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:01:38,788 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:01:38,790 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:01:39,146 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L201: havoc property_#t~bitwise21#1;havoc property_#t~short22#1;havoc property_#t~ite25#1;havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short26#1; [2025-03-03 23:01:39,190 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-03 23:01:39,190 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:01:39,213 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:01:39,214 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:01:39,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:01:39 BoogieIcfgContainer [2025-03-03 23:01:39,214 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:01:39,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:01:39,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:01:39,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:01:39,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:01:38" (1/3) ... [2025-03-03 23:01:39,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d1b711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:01:39, skipping insertion in model container [2025-03-03 23:01:39,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:38" (2/3) ... [2025-03-03 23:01:39,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d1b711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:01:39, skipping insertion in model container [2025-03-03 23:01:39,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:01:39" (3/3) ... [2025-03-03 23:01:39,222 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-69.i [2025-03-03 23:01:39,232 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:01:39,233 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-69.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:01:39,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:01:39,280 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39ed29ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:01:39,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:01:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 76 states have (on average 1.5) internal successors, (114), 77 states have internal predecessors, (114), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:01:39,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 23:01:39,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:39,296 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:39,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:39,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:39,301 INFO L85 PathProgramCache]: Analyzing trace with hash -369447987, now seen corresponding path program 1 times [2025-03-03 23:01:39,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:39,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653390601] [2025-03-03 23:01:39,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:39,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:39,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 23:01:39,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 23:01:39,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:39,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 23:01:39,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653390601] [2025-03-03 23:01:39,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653390601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:01:39,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543420583] [2025-03-03 23:01:39,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:39,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:39,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:39,617 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:01:39,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:01:39,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 23:01:39,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 23:01:39,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:39,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:39,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:01:39,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:01:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 23:01:39,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:01:39,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543420583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:39,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:01:39,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:01:39,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037590236] [2025-03-03 23:01:39,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:39,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:01:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:39,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:01:39,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:01:39,856 INFO L87 Difference]: Start difference. First operand has 107 states, 76 states have (on average 1.5) internal successors, (114), 77 states have internal predecessors, (114), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 23:01:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:39,885 INFO L93 Difference]: Finished difference Result 208 states and 363 transitions. [2025-03-03 23:01:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:01:39,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2025-03-03 23:01:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:39,892 INFO L225 Difference]: With dead ends: 208 [2025-03-03 23:01:39,892 INFO L226 Difference]: Without dead ends: 104 [2025-03-03 23:01:39,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:01:39,897 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:39,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:01:39,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-03 23:01:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-03 23:01:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.445945945945946) internal successors, (107), 74 states have internal predecessors, (107), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:01:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 163 transitions. [2025-03-03 23:01:39,927 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 163 transitions. Word has length 181 [2025-03-03 23:01:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:39,927 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 163 transitions. [2025-03-03 23:01:39,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 23:01:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 163 transitions. [2025-03-03 23:01:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 23:01:39,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:39,930 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:39,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:01:40,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:01:40,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:40,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:40,132 INFO L85 PathProgramCache]: Analyzing trace with hash 568224687, now seen corresponding path program 1 times [2025-03-03 23:01:40,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:40,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806301627] [2025-03-03 23:01:40,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:40,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:40,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 23:01:40,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 23:01:40,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:40,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:01:40,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:40,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806301627] [2025-03-03 23:01:40,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806301627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:40,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:40,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:01:40,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939518517] [2025-03-03 23:01:40,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:40,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:01:40,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:40,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:01:40,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:01:40,686 INFO L87 Difference]: Start difference. First operand 104 states and 163 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:01:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:40,916 INFO L93 Difference]: Finished difference Result 308 states and 486 transitions. [2025-03-03 23:01:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:01:40,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2025-03-03 23:01:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:40,919 INFO L225 Difference]: With dead ends: 308 [2025-03-03 23:01:40,922 INFO L226 Difference]: Without dead ends: 207 [2025-03-03 23:01:40,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:01:40,923 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 119 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:40,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 540 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:01:40,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-03 23:01:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 163. [2025-03-03 23:01:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 23:01:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 258 transitions. [2025-03-03 23:01:40,952 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 258 transitions. Word has length 181 [2025-03-03 23:01:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:40,953 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 258 transitions. [2025-03-03 23:01:40,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:01:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 258 transitions. [2025-03-03 23:01:40,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 23:01:40,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:40,955 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:40,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:01:40,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:40,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2061845767, now seen corresponding path program 1 times [2025-03-03 23:01:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:40,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636347903] [2025-03-03 23:01:40,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:40,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:40,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 23:01:41,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 23:01:41,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:41,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:01:41,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:41,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636347903] [2025-03-03 23:01:41,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636347903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:41,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:41,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:01:41,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434009383] [2025-03-03 23:01:41,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:41,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:01:41,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:41,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:01:41,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:01:41,476 INFO L87 Difference]: Start difference. First operand 163 states and 258 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:01:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:41,587 INFO L93 Difference]: Finished difference Result 370 states and 586 transitions. [2025-03-03 23:01:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:01:41,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2025-03-03 23:01:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:41,591 INFO L225 Difference]: With dead ends: 370 [2025-03-03 23:01:41,592 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 23:01:41,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:01:41,594 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 148 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:41,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 420 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:01:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 23:01:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 263. [2025-03-03 23:01:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 175 states have (on average 1.4057142857142857) internal successors, (246), 175 states have internal predecessors, (246), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 23:01:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 414 transitions. [2025-03-03 23:01:41,625 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 414 transitions. Word has length 182 [2025-03-03 23:01:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:41,626 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 414 transitions. [2025-03-03 23:01:41,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:01:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 414 transitions. [2025-03-03 23:01:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 23:01:41,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:41,630 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:41,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:01:41,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:41,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:41,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1932763048, now seen corresponding path program 1 times [2025-03-03 23:01:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:41,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602834986] [2025-03-03 23:01:41,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:41,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:41,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 23:01:41,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 23:01:41,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:41,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:01:42,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:42,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602834986] [2025-03-03 23:01:42,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602834986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:42,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:42,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:01:42,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332032375] [2025-03-03 23:01:42,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:42,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:01:42,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:42,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:01:42,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:01:42,208 INFO L87 Difference]: Start difference. First operand 263 states and 414 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:01:42,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:42,392 INFO L93 Difference]: Finished difference Result 468 states and 732 transitions. [2025-03-03 23:01:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:01:42,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2025-03-03 23:01:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:42,396 INFO L225 Difference]: With dead ends: 468 [2025-03-03 23:01:42,397 INFO L226 Difference]: Without dead ends: 270 [2025-03-03 23:01:42,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:01:42,399 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 193 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:42,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 554 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:01:42,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-03 23:01:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2025-03-03 23:01:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 178 states have (on average 1.3932584269662922) internal successors, (248), 178 states have internal predecessors, (248), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 23:01:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 416 transitions. [2025-03-03 23:01:42,432 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 416 transitions. Word has length 182 [2025-03-03 23:01:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:42,433 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 416 transitions. [2025-03-03 23:01:42,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:01:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 416 transitions. [2025-03-03 23:01:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 23:01:42,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:42,435 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:42,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:01:42,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:42,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:42,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1104554987, now seen corresponding path program 1 times [2025-03-03 23:01:42,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:42,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655687565] [2025-03-03 23:01:42,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:42,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:42,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 23:01:42,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 23:01:42,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:42,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 23:01:42,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:42,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655687565] [2025-03-03 23:01:42,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655687565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:01:42,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601762357] [2025-03-03 23:01:42,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:42,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:42,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:42,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:01:42,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:01:42,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 23:01:42,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 23:01:42,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:42,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:42,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 23:01:42,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:01:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 543 proven. 63 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2025-03-03 23:01:43,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:01:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 23:01:43,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601762357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:01:43,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:01:43,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 9 [2025-03-03 23:01:43,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371303264] [2025-03-03 23:01:43,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:01:43,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:01:43,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:43,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:01:43,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:01:43,282 INFO L87 Difference]: Start difference. First operand 267 states and 416 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2025-03-03 23:01:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:43,505 INFO L93 Difference]: Finished difference Result 489 states and 747 transitions. [2025-03-03 23:01:43,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:01:43,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 183 [2025-03-03 23:01:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:43,508 INFO L225 Difference]: With dead ends: 489 [2025-03-03 23:01:43,508 INFO L226 Difference]: Without dead ends: 285 [2025-03-03 23:01:43,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:01:43,511 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 171 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:43,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 374 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:01:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-03 23:01:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 265. [2025-03-03 23:01:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 173 states have (on average 1.3121387283236994) internal successors, (227), 174 states have internal predecessors, (227), 84 states have call successors, (84), 7 states have call predecessors, (84), 7 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 23:01:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 395 transitions. [2025-03-03 23:01:43,533 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 395 transitions. Word has length 183 [2025-03-03 23:01:43,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:43,533 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 395 transitions. [2025-03-03 23:01:43,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2025-03-03 23:01:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 395 transitions. [2025-03-03 23:01:43,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 23:01:43,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:43,535 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:43,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 23:01:43,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:43,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:43,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:43,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2098415366, now seen corresponding path program 1 times [2025-03-03 23:01:43,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:43,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049980640] [2025-03-03 23:01:43,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:43,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 23:01:43,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 23:01:43,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:43,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 23:01:44,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:44,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049980640] [2025-03-03 23:01:44,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049980640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:01:44,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033136982] [2025-03-03 23:01:44,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:44,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:44,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:44,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:01:44,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:01:44,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 23:01:44,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 23:01:44,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:44,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:44,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 23:01:44,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:01:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2025-03-03 23:01:44,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:01:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 23:01:44,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033136982] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:01:44,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:01:44,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-03 23:01:44,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841732259] [2025-03-03 23:01:44,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:01:44,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:01:44,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:44,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:01:44,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:01:44,367 INFO L87 Difference]: Start difference. First operand 265 states and 395 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-03 23:01:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:44,758 INFO L93 Difference]: Finished difference Result 505 states and 737 transitions. [2025-03-03 23:01:44,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 23:01:44,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 184 [2025-03-03 23:01:44,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:44,762 INFO L225 Difference]: With dead ends: 505 [2025-03-03 23:01:44,762 INFO L226 Difference]: Without dead ends: 295 [2025-03-03 23:01:44,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 365 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-03 23:01:44,764 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 438 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:44,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 453 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:01:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-03 23:01:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 277. [2025-03-03 23:01:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 182 states have (on average 1.2857142857142858) internal successors, (234), 183 states have internal predecessors, (234), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 23:01:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 402 transitions. [2025-03-03 23:01:44,785 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 402 transitions. Word has length 184 [2025-03-03 23:01:44,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:44,785 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 402 transitions. [2025-03-03 23:01:44,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-03 23:01:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 402 transitions. [2025-03-03 23:01:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 23:01:44,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:44,787 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:44,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 23:01:44,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:44,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:44,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:44,988 INFO L85 PathProgramCache]: Analyzing trace with hash 158495641, now seen corresponding path program 1 times [2025-03-03 23:01:44,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:44,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839478022] [2025-03-03 23:01:44,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:44,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:44,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 23:01:45,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 23:01:45,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:45,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 129 proven. 27 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2025-03-03 23:01:45,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:45,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839478022] [2025-03-03 23:01:45,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839478022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:01:45,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389669717] [2025-03-03 23:01:45,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:45,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:45,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:45,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:01:45,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 23:01:45,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 23:01:45,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 23:01:45,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:45,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:45,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 23:01:45,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:01:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 599 proven. 27 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2025-03-03 23:01:45,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:01:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 129 proven. 30 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2025-03-03 23:01:45,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389669717] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:01:45,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:01:45,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-03 23:01:45,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022120600] [2025-03-03 23:01:45,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:01:45,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 23:01:45,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:45,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 23:01:45,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:01:45,989 INFO L87 Difference]: Start difference. First operand 277 states and 402 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2025-03-03 23:01:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:46,920 INFO L93 Difference]: Finished difference Result 655 states and 924 transitions. [2025-03-03 23:01:46,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 23:01:46,920 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 184 [2025-03-03 23:01:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:46,923 INFO L225 Difference]: With dead ends: 655 [2025-03-03 23:01:46,923 INFO L226 Difference]: Without dead ends: 437 [2025-03-03 23:01:46,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 364 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 23:01:46,928 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 640 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:46,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1073 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:01:46,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-03 23:01:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 289. [2025-03-03 23:01:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 191 states have (on average 1.2722513089005236) internal successors, (243), 192 states have internal predecessors, (243), 84 states have call successors, (84), 13 states have call predecessors, (84), 13 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 23:01:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 411 transitions. [2025-03-03 23:01:46,956 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 411 transitions. Word has length 184 [2025-03-03 23:01:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:46,957 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 411 transitions. [2025-03-03 23:01:46,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2025-03-03 23:01:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 411 transitions. [2025-03-03 23:01:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-03 23:01:46,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:46,958 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:46,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 23:01:47,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:47,163 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:47,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:47,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1457282488, now seen corresponding path program 1 times [2025-03-03 23:01:47,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:47,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990315151] [2025-03-03 23:01:47,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:47,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:47,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-03 23:01:47,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-03 23:01:47,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:47,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 23:01:47,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:47,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990315151] [2025-03-03 23:01:47,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990315151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:47,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:47,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:01:47,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836102088] [2025-03-03 23:01:47,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:47,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:01:47,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:47,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:01:47,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:01:47,337 INFO L87 Difference]: Start difference. First operand 289 states and 411 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:01:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:47,538 INFO L93 Difference]: Finished difference Result 568 states and 811 transitions. [2025-03-03 23:01:47,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:01:47,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2025-03-03 23:01:47,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:47,541 INFO L225 Difference]: With dead ends: 568 [2025-03-03 23:01:47,541 INFO L226 Difference]: Without dead ends: 342 [2025-03-03 23:01:47,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:01:47,546 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 96 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:47,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 415 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:01:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-03 23:01:47,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 295. [2025-03-03 23:01:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 197 states have internal predecessors, (252), 84 states have call successors, (84), 13 states have call predecessors, (84), 13 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 23:01:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 420 transitions. [2025-03-03 23:01:47,569 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 420 transitions. Word has length 185 [2025-03-03 23:01:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:47,569 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 420 transitions. [2025-03-03 23:01:47,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 23:01:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 420 transitions. [2025-03-03 23:01:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 23:01:47,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:47,571 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:47,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 23:01:47,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:47,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash -630794175, now seen corresponding path program 1 times [2025-03-03 23:01:47,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:47,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397807818] [2025-03-03 23:01:47,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:47,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:47,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 23:01:47,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 23:01:47,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:47,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:01:47,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [216256146] [2025-03-03 23:01:47,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:47,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:47,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:47,622 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:01:47,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 23:01:47,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 23:01:47,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 23:01:47,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:47,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:01:47,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:01:47,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 23:01:47,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 23:01:47,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:47,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:01:47,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:01:47,838 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:01:47,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:01:47,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 23:01:48,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:48,044 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:01:48,161 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:01:48,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:01:48 BoogieIcfgContainer [2025-03-03 23:01:48,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:01:48,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:01:48,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:01:48,167 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:01:48,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:01:39" (3/4) ... [2025-03-03 23:01:48,169 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:01:48,170 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:01:48,171 INFO L158 Benchmark]: Toolchain (without parser) took 9870.39ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 122.2MB in the beginning and 92.3MB in the end (delta: 29.9MB). Peak memory consumption was 111.3MB. Max. memory is 16.1GB. [2025-03-03 23:01:48,171 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:01:48,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.11ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 106.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:01:48,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.01ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 102.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:01:48,172 INFO L158 Benchmark]: Boogie Preprocessor took 60.87ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 98.8MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:01:48,172 INFO L158 Benchmark]: IcfgBuilder took 532.21ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 68.1MB in the end (delta: 30.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 23:01:48,172 INFO L158 Benchmark]: TraceAbstraction took 8948.68ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 67.2MB in the beginning and 92.4MB in the end (delta: -25.2MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2025-03-03 23:01:48,173 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 251.7MB. Free memory was 92.4MB in the beginning and 92.3MB in the end (delta: 78.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:01:48,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.15ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.11ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 106.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.01ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 102.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.87ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 98.8MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 532.21ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 68.1MB in the end (delta: 30.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8948.68ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 67.2MB in the beginning and 92.4MB in the end (delta: -25.2MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 251.7MB. Free memory was 92.4MB in the beginning and 92.3MB in the end (delta: 78.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 166, overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 168, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryFLOATComparisonOperation at line 164, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of bitwiseOr at line 201, overapproximation of bitwiseOr at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 201. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned short int var_1_3 = 47136; [L25] unsigned short int var_1_4 = 10; [L26] unsigned long int var_1_6 = 1660677957; [L27] unsigned long int var_1_7 = 128; [L28] float var_1_9 = 9.4; [L29] float var_1_12 = 16.2; [L30] float var_1_13 = 127.9; [L31] float var_1_14 = 15.5; [L32] unsigned long int var_1_15 = 100; [L33] signed char var_1_16 = 64; [L34] float var_1_17 = 9.7; [L35] signed char var_1_18 = -64; [L36] signed char var_1_19 = -4; [L37] unsigned short int var_1_20 = 64; [L38] unsigned short int var_1_21 = 1; [L39] signed char var_1_22 = 2; [L40] unsigned long int var_1_23 = 8; [L41] unsigned char var_1_24 = 0; [L42] unsigned char var_1_25 = 0; [L43] unsigned char var_1_26 = 0; [L44] unsigned char var_1_27 = 0; [L45] unsigned char var_1_28 = 0; [L46] float last_1_var_1_9 = 9.4; [L47] float last_1_var_1_14 = 15.5; [L48] unsigned long int last_1_var_1_15 = 100; [L49] unsigned short int last_1_var_1_20 = 64; [L50] unsigned long int last_1_var_1_23 = 8; [L51] unsigned char last_1_var_1_24 = 0; VAL [isInitial=0, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L205] isInitial = 1 [L206] FCALL initially() [L207] COND TRUE 1 [L208] CALL updateLastVariables() [L193] last_1_var_1_9 = var_1_9 [L194] last_1_var_1_14 = var_1_14 [L195] last_1_var_1_15 = var_1_15 [L196] last_1_var_1_20 = var_1_20 [L197] last_1_var_1_23 = var_1_23 [L198] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L208] RET updateLastVariables() [L209] CALL updateVariables() [L148] var_1_2 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L149] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L150] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L150] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L151] var_1_3 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L152] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L153] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L153] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L154] var_1_4 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L155] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L156] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L156] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L157] var_1_6 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L158] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L159] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L159] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L160] var_1_7 = __VERIFIER_nondet_ulong() [L161] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_9=47/5] [L161] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_9=47/5] [L162] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L162] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L163] var_1_12 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L164] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L165] var_1_13 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L166] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L167] var_1_17 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L168] RET assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L169] CALL assume_abort_if_not(var_1_17 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L169] RET assume_abort_if_not(var_1_17 != 0.0F) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L170] var_1_18 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L171] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L172] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L172] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L173] var_1_19 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L174] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L175] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L175] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L176] var_1_21 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L177] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L178] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L178] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L180] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L181] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L181] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L182] var_1_26 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L183] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L184] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L184] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L185] var_1_27 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L186] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L187] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L187] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L188] var_1_28 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L189] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L190] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L190] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L209] RET updateVariables() [L210] CALL step() [L55] unsigned long int stepLocal_0 = var_1_6 * last_1_var_1_23; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L56] COND FALSE !(\read(last_1_var_1_24)) [L63] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L65] COND TRUE last_1_var_1_14 >= (var_1_13 * last_1_var_1_9) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L66] COND TRUE \read(var_1_2) [L67] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L80] COND FALSE !(var_1_24 && (var_1_20 < (3349670375u - var_1_4))) [L87] var_1_15 = var_1_20 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L89] EXPR var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L89] COND FALSE !(last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) [L96] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L98] unsigned short int stepLocal_3 = var_1_21; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L99] COND TRUE var_1_14 < (9999.6f + var_1_12) [L100] var_1_23 = var_1_20 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L112] COND FALSE !((256.2 * var_1_14) < var_1_14) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L117] COND FALSE !(var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) [L120] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L122] COND FALSE !(var_1_13 >= var_1_14) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L131] signed char stepLocal_2 = var_1_19; [L132] unsigned long int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_1=1073741823, stepLocal_2=0, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L133] COND TRUE var_1_12 <= var_1_14 [L134] var_1_22 = var_1_19 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_1=1073741823, stepLocal_2=0, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L210] RET step() [L211] CALL, EXPR property() [L201] EXPR (((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L201] EXPR var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L201] EXPR (((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L201] EXPR ((((((((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12)))) && ((var_1_24 && (var_1_20 < (3349670375u - var_1_4))) ? ((var_1_3 > var_1_4) ? (var_1_15 == ((unsigned long int) (4063422496u - 64u))) : (var_1_15 == ((unsigned long int) var_1_20))) : (var_1_15 == ((unsigned long int) var_1_20)))) && ((var_1_13 >= var_1_14) ? ((((- var_1_9) * (var_1_14 * var_1_13)) < var_1_12) ? (((- var_1_14) <= (((((var_1_9) > (4.375f)) ? (var_1_9) : (4.375f))) * (var_1_9 / var_1_17))) ? (var_1_16 == ((signed char) ((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_16 == ((signed char) 1))) : 1) : 1)) && (last_1_var_1_24 ? (((var_1_6 * last_1_var_1_23) < var_1_7) ? (var_1_20 == ((unsigned short int) (var_1_4 + var_1_21))) : (var_1_20 == ((unsigned short int) var_1_4))) : (var_1_20 == ((unsigned short int) var_1_21)))) && ((var_1_12 <= var_1_14) ? (var_1_22 == ((signed char) var_1_19)) : (((((((var_1_3 * var_1_16)) < (var_1_20)) ? ((var_1_3 * var_1_16)) : (var_1_20))) > var_1_6) ? ((var_1_19 <= var_1_6) ? (var_1_22 == ((signed char) var_1_18)) : (var_1_22 == ((signed char) var_1_19))) : (var_1_22 == ((signed char) var_1_18))))) && ((var_1_14 < (9999.6f + var_1_12)) ? (var_1_23 == ((unsigned long int) var_1_20)) : ((var_1_14 <= (- (- var_1_14))) ? ((var_1_21 != (- (last_1_var_1_23 & var_1_20))) ? (var_1_23 == ((unsigned long int) var_1_20)) : (var_1_23 == ((unsigned long int) var_1_20))) : (var_1_23 == ((unsigned long int) var_1_3)))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L201-L202] return (((((((((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12)))) && ((var_1_24 && (var_1_20 < (3349670375u - var_1_4))) ? ((var_1_3 > var_1_4) ? (var_1_15 == ((unsigned long int) (4063422496u - 64u))) : (var_1_15 == ((unsigned long int) var_1_20))) : (var_1_15 == ((unsigned long int) var_1_20)))) && ((var_1_13 >= var_1_14) ? ((((- var_1_9) * (var_1_14 * var_1_13)) < var_1_12) ? (((- var_1_14) <= (((((var_1_9) > (4.375f)) ? (var_1_9) : (4.375f))) * (var_1_9 / var_1_17))) ? (var_1_16 == ((signed char) ((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_16 == ((signed char) 1))) : 1) : 1)) && (last_1_var_1_24 ? (((var_1_6 * last_1_var_1_23) < var_1_7) ? (var_1_20 == ((unsigned short int) (var_1_4 + var_1_21))) : (var_1_20 == ((unsigned short int) var_1_4))) : (var_1_20 == ((unsigned short int) var_1_21)))) && ((var_1_12 <= var_1_14) ? (var_1_22 == ((signed char) var_1_19)) : (((((((var_1_3 * var_1_16)) < (var_1_20)) ? ((var_1_3 * var_1_16)) : (var_1_20))) > var_1_6) ? ((var_1_19 <= var_1_6) ? (var_1_22 == ((signed char) var_1_18)) : (var_1_22 == ((signed char) var_1_19))) : (var_1_22 == ((signed char) var_1_18))))) && ((var_1_14 < (9999.6f + var_1_12)) ? (var_1_23 == ((unsigned long int) var_1_20)) : ((var_1_14 <= (- (- var_1_14))) ? ((var_1_21 != (- (last_1_var_1_23 & var_1_20))) ? (var_1_23 == ((unsigned long int) var_1_20)) : (var_1_23 == ((unsigned long int) var_1_20))) : (var_1_23 == ((unsigned long int) var_1_3))))) && ((last_1_var_1_14 >= (var_1_13 * last_1_var_1_9)) ? (var_1_2 ? (var_1_24 == ((unsigned char) var_1_25)) : (var_1_24 == ((unsigned char) (var_1_25 || var_1_26)))) : (var_1_25 ? (var_1_24 == ((unsigned char) (var_1_26 && var_1_27))) : ((last_1_var_1_15 == last_1_var_1_20) ? (var_1_24 == ((unsigned char) var_1_28)) : 1))) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1879 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1805 mSDsluCounter, 3988 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2753 mSDsCounter, 763 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1403 IncrementalHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 763 mSolverCounterUnsat, 1235 mSDtfsCounter, 1403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1380 GetRequests, 1289 SyntacticMatches, 5 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=8, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 283 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2568 NumberOfCodeBlocks, 2568 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2730 ConstructedInterpolants, 0 QuantifiedInterpolants, 6499 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1698 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 22299/22680 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:01:48,198 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/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-69.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 01b73e46276f70692a601510faa80641db7bb7027bfb04cc38bc964dfdc1b93b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:01:50,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:01:50,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:01:50,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:01:50,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:01:50,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:01:50,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:01:50,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:01:50,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:01:50,324 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:01:50,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:01:50,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:01:50,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:01:50,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:01:50,325 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:01:50,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:01:50,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:01:50,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:01:50,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:01:50,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:01:50,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:01:50,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:01:50,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:01:50,326 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:01:50,326 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:01:50,327 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:01:50,327 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:01:50,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:01:50,327 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:01:50,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:01:50,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:01:50,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:01:50,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:01:50,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:01:50,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:01:50,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:01:50,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:01:50,328 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:01:50,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:01:50,328 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:01:50,328 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:01:50,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:01:50,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:01:50,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:01:50,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:01:50,329 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 01b73e46276f70692a601510faa80641db7bb7027bfb04cc38bc964dfdc1b93b [2025-03-03 23:01:50,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:01:50,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:01:50,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:01:50,602 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:01:50,602 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:01:50,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-69.i [2025-03-03 23:01:51,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceb87cd55/a5310b5532ee46ec9b7312bb4a1419b0/FLAG5b9050460 [2025-03-03 23:01:52,054 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:01:52,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-69.i [2025-03-03 23:01:52,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceb87cd55/a5310b5532ee46ec9b7312bb4a1419b0/FLAG5b9050460 [2025-03-03 23:01:52,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceb87cd55/a5310b5532ee46ec9b7312bb4a1419b0 [2025-03-03 23:01:52,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:01:52,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:01:52,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:01:52,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:01:52,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:01:52,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:01:52" (1/1) ... [2025-03-03 23:01:52,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66faecbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52, skipping insertion in model container [2025-03-03 23:01:52,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:01:52" (1/1) ... [2025-03-03 23:01:52,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:01:52,541 WARN L250 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-while_file-69.i[916,929] [2025-03-03 23:01:52,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:01:52,605 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:01:52,614 WARN L250 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-while_file-69.i[916,929] [2025-03-03 23:01:52,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:01:52,671 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:01:52,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52 WrapperNode [2025-03-03 23:01:52,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:01:52,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:01:52,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:01:52,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:01:52,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52" (1/1) ... [2025-03-03 23:01:52,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52" (1/1) ... [2025-03-03 23:01:52,716 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2025-03-03 23:01:52,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:01:52,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:01:52,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:01:52,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:01:52,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52" (1/1) ... [2025-03-03 23:01:52,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52" (1/1) ... [2025-03-03 23:01:52,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52" (1/1) ... [2025-03-03 23:01:52,757 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]. [2025-03-03 23:01:52,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52" (1/1) ... [2025-03-03 23:01:52,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52" (1/1) ... [2025-03-03 23:01:52,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52" (1/1) ... [2025-03-03 23:01:52,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52" (1/1) ... [2025-03-03 23:01:52,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52" (1/1) ... [2025-03-03 23:01:52,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52" (1/1) ... [2025-03-03 23:01:52,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:01:52,782 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:01:52,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:01:52,782 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:01:52,783 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52" (1/1) ... [2025-03-03 23:01:52,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:01:52,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:52,810 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) [2025-03-03 23:01:52,817 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 [2025-03-03 23:01:52,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:01:52,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:01:52,832 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:01:52,832 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:01:52,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:01:52,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:01:52,898 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:01:52,899 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:02:05,942 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 23:02:05,943 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:02:05,949 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:02:05,949 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:02:05,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:02:05 BoogieIcfgContainer [2025-03-03 23:02:05,950 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:02:05,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:02:05,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:02:05,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:02:05,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:01:52" (1/3) ... [2025-03-03 23:02:05,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ae4a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:02:05, skipping insertion in model container [2025-03-03 23:02:05,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:52" (2/3) ... [2025-03-03 23:02:05,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ae4a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:02:05, skipping insertion in model container [2025-03-03 23:02:05,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:02:05" (3/3) ... [2025-03-03 23:02:05,957 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-69.i [2025-03-03 23:02:05,966 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:02:05,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-69.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:02:06,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:02:06,013 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;@23e933f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:02:06,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:02:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:02:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 23:02:06,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:02:06,025 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:02:06,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:02:06,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:02:06,028 INFO L85 PathProgramCache]: Analyzing trace with hash 786362526, now seen corresponding path program 1 times [2025-03-03 23:02:06,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:02:06,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473932309] [2025-03-03 23:02:06,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:02:06,037 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 [2025-03-03 23:02:06,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:02:06,040 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) [2025-03-03 23:02:06,041 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 [2025-03-03 23:02:06,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 23:02:06,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 23:02:06,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:02:06,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:02:06,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:02:06,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:02:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-03-03 23:02:06,752 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:02:06,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:02:06,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473932309] [2025-03-03 23:02:06,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473932309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:02:06,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:02:06,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:02:06,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043629471] [2025-03-03 23:02:06,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:02:06,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:02:06,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:02:06,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:02:06,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:02:06,780 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 23:02:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:02:06,803 INFO L93 Difference]: Finished difference Result 164 states and 295 transitions. [2025-03-03 23:02:06,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:02:06,805 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 176 [2025-03-03 23:02:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:02:06,810 INFO L225 Difference]: With dead ends: 164 [2025-03-03 23:02:06,810 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 23:02:06,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:02:06,814 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:02:06,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:02:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 23:02:06,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-03 23:02:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 23:02:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 131 transitions. [2025-03-03 23:02:06,849 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 131 transitions. Word has length 176 [2025-03-03 23:02:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:02:06,849 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 131 transitions. [2025-03-03 23:02:06,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 23:02:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 131 transitions. [2025-03-03 23:02:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 23:02:06,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:02:06,852 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:02:06,869 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 [2025-03-03 23:02:07,052 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 [2025-03-03 23:02:07,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:02:07,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:02:07,053 INFO L85 PathProgramCache]: Analyzing trace with hash 351751036, now seen corresponding path program 1 times [2025-03-03 23:02:07,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:02:07,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698078741] [2025-03-03 23:02:07,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:02:07,054 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 [2025-03-03 23:02:07,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:02:07,056 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) [2025-03-03 23:02:07,057 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 [2025-03-03 23:02:07,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 23:02:07,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 23:02:07,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:02:07,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:02:07,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 23:02:07,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:02:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2025-03-03 23:02:08,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:02:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 23:02:10,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:02:10,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698078741] [2025-03-03 23:02:10,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698078741] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:02:10,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:02:10,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-03 23:02:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055241120] [2025-03-03 23:02:10,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:02:10,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:02:10,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:02:10,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:02:10,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:02:10,746 INFO L87 Difference]: Start difference. First operand 82 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-03 23:02:17,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:02:21,216 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 [] [2025-03-03 23:02:25,223 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 [] [2025-03-03 23:02:29,229 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 [] [2025-03-03 23:02:33,237 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 [] [2025-03-03 23:02:37,242 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 [] [2025-03-03 23:02:41,247 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 [] [2025-03-03 23:02:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:02:42,056 INFO L93 Difference]: Finished difference Result 255 states and 399 transitions. [2025-03-03 23:02:42,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 23:02:42,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 176 [2025-03-03 23:02:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:02:42,059 INFO L225 Difference]: With dead ends: 255 [2025-03-03 23:02:42,059 INFO L226 Difference]: Without dead ends: 176 [2025-03-03 23:02:42,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 344 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-03 23:02:42,060 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 333 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 199 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:02:42,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 304 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 203 Invalid, 7 Unknown, 0 Unchecked, 30.4s Time] [2025-03-03 23:02:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-03 23:02:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2025-03-03 23:02:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 23:02:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 255 transitions. [2025-03-03 23:02:42,080 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 255 transitions. Word has length 176 [2025-03-03 23:02:42,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:02:42,081 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 255 transitions. [2025-03-03 23:02:42,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-03 23:02:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 255 transitions. [2025-03-03 23:02:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 23:02:42,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:02:42,085 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:02:42,105 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 [2025-03-03 23:02:42,285 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 [2025-03-03 23:02:42,285 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:02:42,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:02:42,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2094561371, now seen corresponding path program 1 times [2025-03-03 23:02:42,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:02:42,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513862257] [2025-03-03 23:02:42,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:02:42,286 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 [2025-03-03 23:02:42,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:02:42,290 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) [2025-03-03 23:02:42,291 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 [2025-03-03 23:02:42,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 23:02:42,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 23:02:42,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:02:42,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:02:42,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 23:02:42,939 INFO L279 TraceCheckSpWp]: Computing forward predicates...