./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ecdf8d41b5f6c0ae032c08a143072655ea9b42f95f86d6c7e3ca37b919c75feb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:02:18,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:02:18,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:02:18,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:02:18,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:02:18,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:02:18,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:02:18,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:02:18,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:02:18,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:02:18,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:02:18,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:02:18,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:02:18,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:02:18,164 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:02:18,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:02:18,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:02:18,164 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:02:18,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:02:18,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:02:18,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:02:18,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:02:18,165 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:02:18,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:02:18,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:02:18,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:02:18,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:02:18,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:02:18,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:02:18,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:02:18,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:02:18,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:02:18,167 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-jdk21/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 -> ecdf8d41b5f6c0ae032c08a143072655ea9b42f95f86d6c7e3ca37b919c75feb [2025-01-09 13:02:18,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:02:18,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:02:18,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:02:18,385 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:02:18,386 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:02:18,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i [2025-01-09 13:02:19,493 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c10ef2e1f/82f97d1d520944fc954d0ad83b4d1e37/FLAG918189fc3 [2025-01-09 13:02:19,725 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:02:19,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i [2025-01-09 13:02:19,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c10ef2e1f/82f97d1d520944fc954d0ad83b4d1e37/FLAG918189fc3 [2025-01-09 13:02:20,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c10ef2e1f/82f97d1d520944fc954d0ad83b4d1e37 [2025-01-09 13:02:20,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:02:20,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:02:20,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:02:20,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:02:20,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:02:20,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba96874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20, skipping insertion in model container [2025-01-09 13:02:20,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:02:20,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i[916,929] [2025-01-09 13:02:20,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:02:20,207 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:02:20,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i[916,929] [2025-01-09 13:02:20,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:02:20,255 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:02:20,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20 WrapperNode [2025-01-09 13:02:20,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:02:20,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:02:20,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:02:20,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:02:20,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,292 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 260 [2025-01-09 13:02:20,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:02:20,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:02:20,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:02:20,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:02:20,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,311 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-01-09 13:02:20,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,317 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:02:20,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:02:20,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:02:20,333 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:02:20,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20" (1/1) ... [2025-01-09 13:02:20,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:02:20,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:02:20,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:02:20,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:02:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:02:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:02:20,371 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:02:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:02:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:02:20,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:02:20,421 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:02:20,423 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:02:20,751 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 13:02:20,751 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:02:20,762 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:02:20,762 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:02:20,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:02:20 BoogieIcfgContainer [2025-01-09 13:02:20,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:02:20,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:02:20,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:02:20,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:02:20,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:02:20" (1/3) ... [2025-01-09 13:02:20,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113b05e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:02:20, skipping insertion in model container [2025-01-09 13:02:20,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:20" (2/3) ... [2025-01-09 13:02:20,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113b05e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:02:20, skipping insertion in model container [2025-01-09 13:02:20,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:02:20" (3/3) ... [2025-01-09 13:02:20,771 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-15.i [2025-01-09 13:02:20,781 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:02:20,782 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-15.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:02:20,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:02:20,838 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;@93a4046, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:02:20,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:02:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 82 states have internal predecessors, (118), 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-01-09 13:02:20,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-09 13:02:20,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:20,854 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, 1] [2025-01-09 13:02:20,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:20,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:20,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1720797954, now seen corresponding path program 1 times [2025-01-09 13:02:20,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:20,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386534775] [2025-01-09 13:02:20,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:20,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:20,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 13:02:20,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 13:02:20,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:20,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:21,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 13:02:21,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:02:21,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386534775] [2025-01-09 13:02:21,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386534775] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:02:21,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063896823] [2025-01-09 13:02:21,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:21,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:02:21,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:02:21,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:02:21,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:02:21,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 13:02:21,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 13:02:21,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:21,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:21,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:02:21,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:02:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 13:02:21,324 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:02:21,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063896823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:21,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:02:21,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:02:21,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990481321] [2025-01-09 13:02:21,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:21,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:02:21,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:02:21,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:02:21,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:02:21,340 INFO L87 Difference]: Start difference. First operand has 112 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 82 states have internal predecessors, (118), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-01-09 13:02:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:21,357 INFO L93 Difference]: Finished difference Result 218 states and 371 transitions. [2025-01-09 13:02:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:02:21,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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 188 [2025-01-09 13:02:21,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:21,362 INFO L225 Difference]: With dead ends: 218 [2025-01-09 13:02:21,362 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 13:02:21,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 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-01-09 13:02:21,366 INFO L435 NwaCegarLoop]: 169 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, 169 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-01-09 13:02:21,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:02:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 13:02:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 13:02:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 79 states have internal predecessors, (113), 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-01-09 13:02:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 169 transitions. [2025-01-09 13:02:21,392 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 169 transitions. Word has length 188 [2025-01-09 13:02:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:21,392 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 169 transitions. [2025-01-09 13:02:21,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-01-09 13:02:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 169 transitions. [2025-01-09 13:02:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-09 13:02:21,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:21,395 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, 1] [2025-01-09 13:02:21,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:02:21,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:02:21,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:21,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:21,597 INFO L85 PathProgramCache]: Analyzing trace with hash -8486774, now seen corresponding path program 1 times [2025-01-09 13:02:21,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:21,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603640377] [2025-01-09 13:02:21,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:21,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:21,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 13:02:21,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 13:02:21,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:21,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:21,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:02:21,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:02:21,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603640377] [2025-01-09 13:02:21,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603640377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:21,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:02:21,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:02:21,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066400232] [2025-01-09 13:02:21,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:21,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:02:21,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:02:21,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:02:21,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:02:21,776 INFO L87 Difference]: Start difference. First operand 109 states and 169 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-09 13:02:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:21,833 INFO L93 Difference]: Finished difference Result 316 states and 491 transitions. [2025-01-09 13:02:21,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:02:21,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 188 [2025-01-09 13:02:21,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:21,835 INFO L225 Difference]: With dead ends: 316 [2025-01-09 13:02:21,835 INFO L226 Difference]: Without dead ends: 210 [2025-01-09 13:02:21,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:02:21,836 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 150 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:02:21,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 457 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:02:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-01-09 13:02:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 136. [2025-01-09 13:02:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.4528301886792452) internal successors, (154), 106 states have internal predecessors, (154), 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-01-09 13:02:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 210 transitions. [2025-01-09 13:02:21,856 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 210 transitions. Word has length 188 [2025-01-09 13:02:21,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:21,857 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 210 transitions. [2025-01-09 13:02:21,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-09 13:02:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 210 transitions. [2025-01-09 13:02:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-09 13:02:21,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:21,863 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, 1] [2025-01-09 13:02:21,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:02:21,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:21,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash 132061836, now seen corresponding path program 1 times [2025-01-09 13:02:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:21,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337229496] [2025-01-09 13:02:21,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:21,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 13:02:21,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 13:02:21,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:21,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:02:22,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:02:22,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337229496] [2025-01-09 13:02:22,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337229496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:22,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:02:22,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:02:22,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572946887] [2025-01-09 13:02:22,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:22,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:02:22,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:02:22,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:02:22,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:02:22,129 INFO L87 Difference]: Start difference. First operand 136 states and 210 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-09 13:02:22,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:22,208 INFO L93 Difference]: Finished difference Result 402 states and 624 transitions. [2025-01-09 13:02:22,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:02:22,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 188 [2025-01-09 13:02:22,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:22,213 INFO L225 Difference]: With dead ends: 402 [2025-01-09 13:02:22,214 INFO L226 Difference]: Without dead ends: 269 [2025-01-09 13:02:22,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:02:22,215 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 144 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:02:22,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 374 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:02:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-01-09 13:02:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 207. [2025-01-09 13:02:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 177 states have (on average 1.497175141242938) internal successors, (265), 177 states have internal predecessors, (265), 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-01-09 13:02:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 321 transitions. [2025-01-09 13:02:22,237 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 321 transitions. Word has length 188 [2025-01-09 13:02:22,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:22,237 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 321 transitions. [2025-01-09 13:02:22,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-09 13:02:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 321 transitions. [2025-01-09 13:02:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-09 13:02:22,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:22,241 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, 1, 1] [2025-01-09 13:02:22,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:02:22,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:22,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:22,242 INFO L85 PathProgramCache]: Analyzing trace with hash -259984332, now seen corresponding path program 1 times [2025-01-09 13:02:22,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:22,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302233526] [2025-01-09 13:02:22,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:22,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:22,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-09 13:02:22,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-09 13:02:22,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:22,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:02:22,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:02:22,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302233526] [2025-01-09 13:02:22,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302233526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:22,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:02:22,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:02:22,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632019131] [2025-01-09 13:02:22,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:22,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:02:22,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:02:22,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:02:22,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:02:22,514 INFO L87 Difference]: Start difference. First operand 207 states and 321 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-01-09 13:02:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:22,619 INFO L93 Difference]: Finished difference Result 557 states and 863 transitions. [2025-01-09 13:02:22,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:02:22,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 189 [2025-01-09 13:02:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:22,623 INFO L225 Difference]: With dead ends: 557 [2025-01-09 13:02:22,623 INFO L226 Difference]: Without dead ends: 353 [2025-01-09 13:02:22,624 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-01-09 13:02:22,624 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 136 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:02:22,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 314 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:02:22,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-09 13:02:22,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 318. [2025-01-09 13:02:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 288 states have (on average 1.5173611111111112) internal successors, (437), 288 states have internal predecessors, (437), 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-01-09 13:02:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 493 transitions. [2025-01-09 13:02:22,647 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 493 transitions. Word has length 189 [2025-01-09 13:02:22,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:22,648 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 493 transitions. [2025-01-09 13:02:22,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-01-09 13:02:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 493 transitions. [2025-01-09 13:02:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-09 13:02:22,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:22,651 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, 1, 1] [2025-01-09 13:02:22,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:02:22,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:22,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1194730557, now seen corresponding path program 1 times [2025-01-09 13:02:22,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:22,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276988702] [2025-01-09 13:02:22,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:22,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:22,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-09 13:02:22,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-09 13:02:22,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:22,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:02:22,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:02:22,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276988702] [2025-01-09 13:02:22,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276988702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:22,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:02:22,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:02:22,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123350611] [2025-01-09 13:02:22,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:22,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:02:22,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:02:22,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:02:22,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:02:22,783 INFO L87 Difference]: Start difference. First operand 318 states and 493 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (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-01-09 13:02:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:22,861 INFO L93 Difference]: Finished difference Result 822 states and 1279 transitions. [2025-01-09 13:02:22,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:02:22,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (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 189 [2025-01-09 13:02:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:22,865 INFO L225 Difference]: With dead ends: 822 [2025-01-09 13:02:22,865 INFO L226 Difference]: Without dead ends: 507 [2025-01-09 13:02:22,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:02:22,868 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 144 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:02:22,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 455 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:02:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-01-09 13:02:22,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 318. [2025-01-09 13:02:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 288 states have (on average 1.5173611111111112) internal successors, (437), 288 states have internal predecessors, (437), 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-01-09 13:02:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 493 transitions. [2025-01-09 13:02:22,894 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 493 transitions. Word has length 189 [2025-01-09 13:02:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:22,894 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 493 transitions. [2025-01-09 13:02:22,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (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-01-09 13:02:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 493 transitions. [2025-01-09 13:02:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-09 13:02:22,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:22,897 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, 1, 1] [2025-01-09 13:02:22,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:02:22,898 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:22,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:22,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1177008705, now seen corresponding path program 1 times [2025-01-09 13:02:22,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:22,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125733100] [2025-01-09 13:02:22,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:22,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:22,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-09 13:02:22,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-09 13:02:22,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:22,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:02:23,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:02:23,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125733100] [2025-01-09 13:02:23,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125733100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:23,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:02:23,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:02:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116565962] [2025-01-09 13:02:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:23,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:02:23,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:02:23,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:02:23,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:02:23,096 INFO L87 Difference]: Start difference. First operand 318 states and 493 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-01-09 13:02:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:23,195 INFO L93 Difference]: Finished difference Result 701 states and 1088 transitions. [2025-01-09 13:02:23,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:02:23,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 189 [2025-01-09 13:02:23,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:23,198 INFO L225 Difference]: With dead ends: 701 [2025-01-09 13:02:23,198 INFO L226 Difference]: Without dead ends: 386 [2025-01-09 13:02:23,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-01-09 13:02:23,199 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 46 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:02:23,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 296 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:02:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-01-09 13:02:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 324. [2025-01-09 13:02:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 294 states have (on average 1.5136054421768708) internal successors, (445), 294 states have internal predecessors, (445), 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-01-09 13:02:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 501 transitions. [2025-01-09 13:02:23,233 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 501 transitions. Word has length 189 [2025-01-09 13:02:23,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:23,233 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 501 transitions. [2025-01-09 13:02:23,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-01-09 13:02:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 501 transitions. [2025-01-09 13:02:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 13:02:23,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:23,235 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, 1, 1, 1] [2025-01-09 13:02:23,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:02:23,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:23,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash -511081177, now seen corresponding path program 1 times [2025-01-09 13:02:23,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:23,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742387501] [2025-01-09 13:02:23,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:23,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:23,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 13:02:23,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 13:02:23,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:23,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:02:23,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:02:23,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742387501] [2025-01-09 13:02:23,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742387501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:23,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:02:23,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:02:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125546034] [2025-01-09 13:02:23,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:23,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:02:23,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:02:23,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:02:23,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:02:23,405 INFO L87 Difference]: Start difference. First operand 324 states and 501 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-01-09 13:02:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:23,697 INFO L93 Difference]: Finished difference Result 964 states and 1474 transitions. [2025-01-09 13:02:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:02:23,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 190 [2025-01-09 13:02:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:23,701 INFO L225 Difference]: With dead ends: 964 [2025-01-09 13:02:23,701 INFO L226 Difference]: Without dead ends: 643 [2025-01-09 13:02:23,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-01-09 13:02:23,702 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 364 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:02:23,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 560 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:02:23,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-01-09 13:02:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 457. [2025-01-09 13:02:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 427 states have (on average 1.515222482435597) internal successors, (647), 427 states have internal predecessors, (647), 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-01-09 13:02:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 703 transitions. [2025-01-09 13:02:23,719 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 703 transitions. Word has length 190 [2025-01-09 13:02:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:23,719 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 703 transitions. [2025-01-09 13:02:23,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-01-09 13:02:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 703 transitions. [2025-01-09 13:02:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 13:02:23,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:23,721 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, 1, 1, 1] [2025-01-09 13:02:23,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:02:23,721 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:23,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:23,721 INFO L85 PathProgramCache]: Analyzing trace with hash -753159215, now seen corresponding path program 1 times [2025-01-09 13:02:23,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:02:23,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342195581] [2025-01-09 13:02:23,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:23,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:02:23,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 13:02:23,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 13:02:23,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:23,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:02:23,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641520401] [2025-01-09 13:02:23,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:23,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:02:23,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:02:23,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:02:23,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:02:23,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 13:02:23,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 13:02:23,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:23,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:02:23,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:02:23,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 13:02:23,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 13:02:23,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:23,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:02:24,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:02:24,057 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:02:24,058 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:02:24,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:02:24,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:02:24,262 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:02:24,334 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:02:24,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:02:24 BoogieIcfgContainer [2025-01-09 13:02:24,336 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:02:24,336 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:02:24,336 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:02:24,337 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:02:24,337 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:02:20" (3/4) ... [2025-01-09 13:02:24,338 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:02:24,339 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:02:24,339 INFO L158 Benchmark]: Toolchain (without parser) took 4285.27ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 104.9MB in the beginning and 221.8MB in the end (delta: -116.9MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2025-01-09 13:02:24,339 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 226.5MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:02:24,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.64ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 88.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:02:24,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.24ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 83.7MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:02:24,342 INFO L158 Benchmark]: Boogie Preprocessor took 39.35ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 78.0MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:02:24,342 INFO L158 Benchmark]: RCFGBuilder took 430.28ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 48.2MB in the end (delta: 29.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 13:02:24,342 INFO L158 Benchmark]: TraceAbstraction took 3571.80ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 47.3MB in the beginning and 221.9MB in the end (delta: -174.6MB). Peak memory consumption was 107.4MB. Max. memory is 16.1GB. [2025-01-09 13:02:24,342 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 285.2MB. Free memory was 221.9MB in the beginning and 221.8MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:02:24,343 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.17ms. Allocated memory is still 226.5MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.64ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 88.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.24ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 83.7MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.35ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 78.0MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 430.28ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 48.2MB in the end (delta: 29.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3571.80ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 47.3MB in the beginning and 221.9MB in the end (delta: -174.6MB). Peak memory consumption was 107.4MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 285.2MB. Free memory was 221.9MB in the beginning and 221.8MB in the end (delta: 87.7kB). 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 193, overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 193, overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryDOUBLEComparisonOperation at line 157. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 32; [L23] unsigned char var_1_3 = 32; [L24] unsigned char var_1_4 = 4; [L25] double var_1_5 = 128.5; [L26] signed long int var_1_6 = 64; [L27] signed long int var_1_7 = 4; [L28] double var_1_8 = 1.875; [L29] double var_1_9 = 0.1; [L30] double var_1_10 = 32.6; [L31] double var_1_11 = 0.6; [L32] signed long int var_1_12 = -128; [L33] signed long int var_1_14 = 16; [L34] signed short int var_1_15 = 1; [L35] signed long int var_1_18 = 2; [L36] signed char var_1_19 = 32; [L37] signed char var_1_20 = 50; [L38] signed short int var_1_21 = 16; [L39] unsigned char var_1_22 = 0; [L40] signed long int var_1_23 = 25; [L41] unsigned short int var_1_24 = 50906; [L42] unsigned short int var_1_25 = 21992; [L43] float var_1_26 = 3.25; [L44] float var_1_27 = 10.2; [L45] float var_1_28 = 16.5; [L46] float var_1_29 = 0.0; [L47] float var_1_30 = 99.8; [L48] signed char var_1_31 = 2; [L49] float var_1_33 = 4.2; [L50] unsigned char last_1_var_1_1 = 32; [L51] unsigned char last_1_var_1_22 = 0; [L52] signed long int last_1_var_1_23 = 25; VAL [isInitial=0, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=32, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L197] isInitial = 1 [L198] FCALL initially() [L200] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_22 = var_1_22 [L190] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=32, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L142] var_1_3 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L143] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L144] CALL assume_abort_if_not(var_1_3 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L144] RET assume_abort_if_not(var_1_3 <= 64) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L145] var_1_4 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L146] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L147] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L147] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L148] var_1_6 = __VERIFIER_nondet_long() [L149] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L149] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L150] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L150] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L151] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L151] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L152] var_1_7 = __VERIFIER_nondet_long() [L153] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L153] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L154] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L154] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L155] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L155] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L156] var_1_8 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3, var_1_9=1/10] [L157] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3, var_1_9=1/10] [L158] var_1_9 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L159] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L160] var_1_10 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L161] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L162] var_1_11 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L163] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L164] var_1_18 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_18 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L165] RET assume_abort_if_not(var_1_18 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L166] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L166] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L167] CALL assume_abort_if_not(var_1_18 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L167] RET assume_abort_if_not(var_1_18 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L168] var_1_20 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L169] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L170] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L170] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L171] var_1_24 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_24 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L172] RET assume_abort_if_not(var_1_24 >= 32767) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L173] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L173] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L174] var_1_25 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_25 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L175] RET assume_abort_if_not(var_1_25 >= 16383) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L176] CALL assume_abort_if_not(var_1_25 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L176] RET assume_abort_if_not(var_1_25 <= 32767) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L177] var_1_27 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L178] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L179] var_1_28 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L180] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L181] var_1_29 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_29 >= 4611686.018427382800e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L182] RET assume_abort_if_not((var_1_29 >= 4611686.018427382800e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L183] var_1_31 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L184] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L185] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L185] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L201] RET updateVariables() [L202] CALL step() [L56] COND FALSE !(last_1_var_1_22 || last_1_var_1_22) [L63] var_1_15 = 2 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L65] var_1_22 = 0 [L66] var_1_33 = var_1_10 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L67] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L70] unsigned char stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_1=0, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L71] COND FALSE !(stepLocal_1 || (var_1_4 <= (- var_1_6))) [L74] var_1_14 = 5 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L76] signed long int stepLocal_0 = (var_1_3 / 1) / var_1_6; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=7, var_1_7=3] [L77] COND FALSE !(\read(var_1_22)) [L84] var_1_5 = var_1_10 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L86] signed long int stepLocal_4 = (((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)); VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_4=3, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L87] COND FALSE !((var_1_24 - (var_1_25 - var_1_3)) <= stepLocal_4) [L94] var_1_23 = var_1_1 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L96] var_1_12 = ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100)))) [L97] signed long int stepLocal_7 = -1; [L98] signed long int stepLocal_6 = 0 & var_1_25; [L99] signed short int stepLocal_5 = var_1_15; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_5=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L100] COND FALSE !(stepLocal_5 < var_1_15) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L109] COND TRUE var_1_9 > (var_1_26 * var_1_8) [L110] var_1_19 = var_1_4 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L114] signed short int stepLocal_3 = var_1_15; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L115] EXPR 5 | var_1_3 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L115] EXPR var_1_4 << var_1_18 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L115] unsigned char stepLocal_2 = (5 | var_1_3) < (var_1_4 << var_1_18); [L116] COND FALSE !(stepLocal_2 && (var_1_19 < var_1_23)) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L119] COND TRUE var_1_18 > stepLocal_3 [L120] var_1_21 = var_1_20 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L125] EXPR var_1_15 ^ var_1_21 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L125] COND FALSE !((var_1_15 ^ var_1_21) <= var_1_21) [L202] RET step() [L203] CALL, EXPR property() [L193] EXPR ((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4)))) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L193] EXPR ((((((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4))))) && (var_1_22 == ((unsigned char) 0))) && (((var_1_24 - (var_1_25 - var_1_3)) <= ((((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)))) ? (var_1_22 ? (var_1_23 == ((signed long int) (var_1_24 - var_1_25))) : (var_1_23 == ((signed long int) 50))) : (var_1_23 == ((signed long int) var_1_1)))) && ((var_1_15 < var_1_15) ? ((-1 >= var_1_23) ? ((var_1_23 <= (0 & var_1_25)) ? (var_1_26 == ((float) (var_1_9 - (var_1_27 + var_1_28)))) : 1) : (var_1_26 == ((float) (((((var_1_9) > ((var_1_29 - var_1_28))) ? (var_1_9) : ((var_1_29 - var_1_28)))) - var_1_27)))) : 1)) && (((var_1_15 ^ var_1_21) <= var_1_21) ? ((var_1_22 && var_1_22) ? (var_1_22 ? (var_1_30 == ((float) ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))))) : 1) : ((((var_1_3 + var_1_4) - var_1_31) <= var_1_21) ? ((var_1_20 < var_1_1) ? (var_1_30 == ((float) (var_1_9 - var_1_27))) : (var_1_30 == ((float) ((((var_1_10) > (var_1_8)) ? (var_1_10) : (var_1_8)))))) : 1)) : 1) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L193-L194] return (((((((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4))))) && (var_1_22 == ((unsigned char) 0))) && (((var_1_24 - (var_1_25 - var_1_3)) <= ((((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)))) ? (var_1_22 ? (var_1_23 == ((signed long int) (var_1_24 - var_1_25))) : (var_1_23 == ((signed long int) 50))) : (var_1_23 == ((signed long int) var_1_1)))) && ((var_1_15 < var_1_15) ? ((-1 >= var_1_23) ? ((var_1_23 <= (0 & var_1_25)) ? (var_1_26 == ((float) (var_1_9 - (var_1_27 + var_1_28)))) : 1) : (var_1_26 == ((float) (((((var_1_9) > ((var_1_29 - var_1_28))) ? (var_1_9) : ((var_1_29 - var_1_28)))) - var_1_27)))) : 1)) && (((var_1_15 ^ var_1_21) <= var_1_21) ? ((var_1_22 && var_1_22) ? (var_1_22 ? (var_1_30 == ((float) ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))))) : 1) : ((((var_1_3 + var_1_4) - var_1_31) <= var_1_21) ? ((var_1_20 < var_1_1) ? (var_1_30 == ((float) (var_1_9 - var_1_27))) : (var_1_30 == ((float) ((((var_1_10) > (var_1_8)) ? (var_1_10) : (var_1_8)))))) : 1)) : 1)) && (var_1_33 == ((float) var_1_10)) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=8, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=7, var_1_7=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 984 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 984 mSDsluCounter, 2625 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1094 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 592 IncrementalHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1531 mSDtfsCounter, 592 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=457occurred in iteration=7, InterpolantAutomatonStates: 25, 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, 7 MinimizatonAttempts, 608 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1889 NumberOfCodeBlocks, 1889 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1501 ConstructedInterpolants, 0 QuantifiedInterpolants, 1801 SizeOfPredicates, 0 NumberOfNonLiveVariables, 446 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 12042/12096 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-01-09 13:02:24,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ecdf8d41b5f6c0ae032c08a143072655ea9b42f95f86d6c7e3ca37b919c75feb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:02:26,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:02:26,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:02:26,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:02:26,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:02:26,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:02:26,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:02:26,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:02:26,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:02:26,303 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:02:26,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:02:26,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:02:26,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:02:26,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:02:26,304 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:02:26,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:02:26,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:02:26,304 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:02:26,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:02:26,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:02:26,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:02:26,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:02:26,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:02:26,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:02:26,305 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:02:26,305 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:02:26,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:02:26,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:02:26,305 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:02:26,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:02:26,305 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:02:26,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:02:26,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:02:26,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:02:26,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:02:26,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:02:26,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:02:26,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:02:26,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:02:26,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:02:26,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:02:26,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:02:26,306 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:02:26,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:02:26,306 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:02:26,307 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:02:26,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:02:26,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:02:26,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:02:26,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:02:26,307 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-jdk21/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 -> ecdf8d41b5f6c0ae032c08a143072655ea9b42f95f86d6c7e3ca37b919c75feb [2025-01-09 13:02:26,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:02:26,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:02:26,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:02:26,596 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:02:26,596 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:02:26,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i [2025-01-09 13:02:27,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f939304c/5e35c3755ad24766af51c20fb5a90b42/FLAG5784f3c9b [2025-01-09 13:02:27,945 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:02:27,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i [2025-01-09 13:02:27,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f939304c/5e35c3755ad24766af51c20fb5a90b42/FLAG5784f3c9b [2025-01-09 13:02:27,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f939304c/5e35c3755ad24766af51c20fb5a90b42 [2025-01-09 13:02:27,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:02:27,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:02:27,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:02:27,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:02:27,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:02:27,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:02:27" (1/1) ... [2025-01-09 13:02:27,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1729ec54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:27, skipping insertion in model container [2025-01-09 13:02:27,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:02:27" (1/1) ... [2025-01-09 13:02:27,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:02:28,082 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i[916,929] [2025-01-09 13:02:28,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:02:28,165 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:02:28,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i[916,929] [2025-01-09 13:02:28,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:02:28,232 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:02:28,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28 WrapperNode [2025-01-09 13:02:28,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:02:28,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:02:28,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:02:28,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:02:28,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28" (1/1) ... [2025-01-09 13:02:28,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28" (1/1) ... [2025-01-09 13:02:28,272 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2025-01-09 13:02:28,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:02:28,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:02:28,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:02:28,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:02:28,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28" (1/1) ... [2025-01-09 13:02:28,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28" (1/1) ... [2025-01-09 13:02:28,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28" (1/1) ... [2025-01-09 13:02:28,316 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-01-09 13:02:28,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28" (1/1) ... [2025-01-09 13:02:28,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28" (1/1) ... [2025-01-09 13:02:28,328 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28" (1/1) ... [2025-01-09 13:02:28,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28" (1/1) ... [2025-01-09 13:02:28,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28" (1/1) ... [2025-01-09 13:02:28,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28" (1/1) ... [2025-01-09 13:02:28,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28" (1/1) ... [2025-01-09 13:02:28,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:02:28,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:02:28,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:02:28,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:02:28,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28" (1/1) ... [2025-01-09 13:02:28,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:02:28,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:02:28,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:02:28,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:02:28,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:02:28,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:02:28,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:02:28,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:02:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:02:28,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:02:28,464 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:02:28,465 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:02:40,302 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-09 13:02:40,302 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:02:40,308 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:02:40,309 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:02:40,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:02:40 BoogieIcfgContainer [2025-01-09 13:02:40,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:02:40,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:02:40,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:02:40,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:02:40,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:02:27" (1/3) ... [2025-01-09 13:02:40,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e803c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:02:40, skipping insertion in model container [2025-01-09 13:02:40,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:02:28" (2/3) ... [2025-01-09 13:02:40,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e803c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:02:40, skipping insertion in model container [2025-01-09 13:02:40,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:02:40" (3/3) ... [2025-01-09 13:02:40,316 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-15.i [2025-01-09 13:02:40,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:02:40,325 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-15.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:02:40,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:02:40,363 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;@20642394, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:02:40,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:02:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 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-01-09 13:02:40,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 13:02:40,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:40,374 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] [2025-01-09 13:02:40,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:40,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:40,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1021256903, now seen corresponding path program 1 times [2025-01-09 13:02:40,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:02:40,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622777162] [2025-01-09 13:02:40,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:40,385 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-01-09 13:02:40,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:02:40,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 13:02:40,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:02:40,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 13:02:41,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 13:02:41,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:41,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:41,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:02:41,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:02:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 702 proven. 0 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-01-09 13:02:41,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:02:41,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:02:41,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622777162] [2025-01-09 13:02:41,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622777162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:41,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:02:41,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:02:41,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139291213] [2025-01-09 13:02:41,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:41,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:02:41,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:02:41,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:02:41,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:02:41,163 INFO L87 Difference]: Start difference. First operand has 87 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 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.5) internal successors, (47), 2 states have internal predecessors, (47), 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-01-09 13:02:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:41,183 INFO L93 Difference]: Finished difference Result 168 states and 293 transitions. [2025-01-09 13:02:41,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:02:41,184 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 180 [2025-01-09 13:02:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:41,188 INFO L225 Difference]: With dead ends: 168 [2025-01-09 13:02:41,189 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 13:02:41,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 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-01-09 13:02:41,192 INFO L435 NwaCegarLoop]: 130 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, 130 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-01-09 13:02:41,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:02:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 13:02:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 13:02:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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-01-09 13:02:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 130 transitions. [2025-01-09 13:02:41,230 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 130 transitions. Word has length 180 [2025-01-09 13:02:41,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:41,230 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 130 transitions. [2025-01-09 13:02:41,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-01-09 13:02:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 130 transitions. [2025-01-09 13:02:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 13:02:41,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:41,233 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] [2025-01-09 13:02:41,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-01-09 13:02:41,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 13:02:41,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:41,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:41,435 INFO L85 PathProgramCache]: Analyzing trace with hash -666887999, now seen corresponding path program 1 times [2025-01-09 13:02:41,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:02:41,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793229133] [2025-01-09 13:02:41,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:41,435 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-01-09 13:02:41,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:02:41,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 13:02:41,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:02:41,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 13:02:41,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 13:02:41,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:41,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:42,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 13:02:42,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:02:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:02:42,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:02:42,140 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:02:42,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793229133] [2025-01-09 13:02:42,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793229133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:02:42,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:02:42,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:02:42,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078958399] [2025-01-09 13:02:42,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:02:42,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:02:42,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:02:42,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:02:42,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:02:42,142 INFO L87 Difference]: Start difference. First operand 84 states and 130 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-01-09 13:02:46,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:02:50,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:02:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:02:51,081 INFO L93 Difference]: Finished difference Result 241 states and 374 transitions. [2025-01-09 13:02:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:02:51,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 180 [2025-01-09 13:02:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:02:51,090 INFO L225 Difference]: With dead ends: 241 [2025-01-09 13:02:51,090 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 13:02:51,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:02:51,091 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 111 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-01-09 13:02:51,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 344 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2025-01-09 13:02:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 13:02:51,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 101. [2025-01-09 13:02:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 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-01-09 13:02:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2025-01-09 13:02:51,106 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 180 [2025-01-09 13:02:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:02:51,110 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2025-01-09 13:02:51,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-01-09 13:02:51,110 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2025-01-09 13:02:51,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 13:02:51,112 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:02:51,112 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] [2025-01-09 13:02:51,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 13:02:51,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 13:02:51,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:02:51,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:02:51,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2039731395, now seen corresponding path program 1 times [2025-01-09 13:02:51,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:02:51,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732135192] [2025-01-09 13:02:51,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:02:51,314 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-01-09 13:02:51,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:02:51,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 13:02:51,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 13:02:51,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 13:02:51,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 13:02:51,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:02:51,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:02:52,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 13:02:52,017 INFO L279 TraceCheckSpWp]: Computing forward predicates...