./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.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-1loop_file-94.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 211883c60ce0bb06b72e4a9000b7135ce379464c60607038b1e2cd858553e4b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:00:35,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:00:35,490 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:00:35,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:00:35,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:00:35,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:00:35,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:00:35,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:00:35,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:00:35,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:00:35,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:00:35,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:00:35,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:00:35,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:00:35,529 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:00:35,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:00:35,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:00:35,529 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:00:35,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:00:35,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:00:35,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:00:35,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:00:35,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:00:35,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:00:35,530 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:00:35,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:00:35,530 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:00:35,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:00:35,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:00:35,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:00:35,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:00:35,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:00:35,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:00:35,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:00:35,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:00:35,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:00:35,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:00:35,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:00:35,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:00:35,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:00:35,532 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:00:35,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:00:35,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:00:35,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:00:35,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:00:35,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:00:35,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:00:35,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:00:35,533 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 -> 211883c60ce0bb06b72e4a9000b7135ce379464c60607038b1e2cd858553e4b3 [2025-01-09 13:00:35,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:00:35,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:00:35,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:00:35,762 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:00:35,762 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:00:35,763 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-1loop_file-94.i [2025-01-09 13:00:36,911 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/813f9143e/047dfcb61ce145249f3050d857438f88/FLAGaf1e0422d [2025-01-09 13:00:37,179 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:00:37,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i [2025-01-09 13:00:37,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/813f9143e/047dfcb61ce145249f3050d857438f88/FLAGaf1e0422d [2025-01-09 13:00:37,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/813f9143e/047dfcb61ce145249f3050d857438f88 [2025-01-09 13:00:37,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:00:37,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:00:37,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:00:37,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:00:37,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:00:37,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:00:37" (1/1) ... [2025-01-09 13:00:37,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:37, skipping insertion in model container [2025-01-09 13:00:37,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:00:37" (1/1) ... [2025-01-09 13:00:37,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:00:37,629 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-1loop_file-94.i[916,929] [2025-01-09 13:00:37,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:00:37,703 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:00:37,709 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-1loop_file-94.i[916,929] [2025-01-09 13:00:37,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:00:37,744 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:00:37,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:37 WrapperNode [2025-01-09 13:00:37,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:00:37,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:00:37,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:00:37,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:00:37,751 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:00:37" (1/1) ... [2025-01-09 13:00:37,764 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:00:37" (1/1) ... [2025-01-09 13:00:37,801 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 217 [2025-01-09 13:00:37,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:00:37,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:00:37,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:00:37,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:00:37,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:37" (1/1) ... [2025-01-09 13:00:37,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:37" (1/1) ... [2025-01-09 13:00:37,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:37" (1/1) ... [2025-01-09 13:00:37,838 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:00:37,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:37" (1/1) ... [2025-01-09 13:00:37,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:37" (1/1) ... [2025-01-09 13:00:37,852 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:37" (1/1) ... [2025-01-09 13:00:37,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:37" (1/1) ... [2025-01-09 13:00:37,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:37" (1/1) ... [2025-01-09 13:00:37,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:37" (1/1) ... [2025-01-09 13:00:37,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:37" (1/1) ... [2025-01-09 13:00:37,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:00:37,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:00:37,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:00:37,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:00:37,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:37" (1/1) ... [2025-01-09 13:00:37,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:00:37,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:00:37,894 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:00:37,900 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:00:37,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:00:37,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:00:37,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:00:37,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:00:37,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:00:37,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:00:37,981 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:00:37,982 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:00:38,266 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-09 13:00:38,266 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:00:38,272 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:00:38,273 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:00:38,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:00:38 BoogieIcfgContainer [2025-01-09 13:00:38,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:00:38,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:00:38,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:00:38,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:00:38,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:00:37" (1/3) ... [2025-01-09 13:00:38,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36eff74d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:00:38, skipping insertion in model container [2025-01-09 13:00:38,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:37" (2/3) ... [2025-01-09 13:00:38,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36eff74d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:00:38, skipping insertion in model container [2025-01-09 13:00:38,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:00:38" (3/3) ... [2025-01-09 13:00:38,279 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-94.i [2025-01-09 13:00:38,289 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:00:38,290 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-94.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:00:38,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:00:38,328 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;@6a69c465, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:00:38,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:00:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 13:00:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 13:00:38,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:38,358 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:38,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:38,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:38,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2078912542, now seen corresponding path program 1 times [2025-01-09 13:00:38,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:38,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39429655] [2025-01-09 13:00:38,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:38,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:38,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 13:00:38,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 13:00:38,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:38,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 13:00:38,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:38,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39429655] [2025-01-09 13:00:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39429655] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:00:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028551908] [2025-01-09 13:00:38,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:38,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:00:38,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:00:38,599 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:00:38,608 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:00:38,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 13:00:38,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 13:00:38,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:38,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:38,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:00:38,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:00:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 13:00:38,752 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:00:38,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028551908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:38,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:00:38,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:00:38,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686042935] [2025-01-09 13:00:38,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:38,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:00:38,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:38,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:00:38,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:00:38,769 INFO L87 Difference]: Start difference. First operand has 91 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 13:00:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:38,786 INFO L93 Difference]: Finished difference Result 179 states and 306 transitions. [2025-01-09 13:00:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:00:38,787 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 178 [2025-01-09 13:00:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:38,791 INFO L225 Difference]: With dead ends: 179 [2025-01-09 13:00:38,792 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 13:00:38,794 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:00:38,795 INFO L435 NwaCegarLoop]: 139 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, 139 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:00:38,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:00:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 13:00:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 13:00:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 13:00:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 136 transitions. [2025-01-09 13:00:38,822 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 136 transitions. Word has length 178 [2025-01-09 13:00:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:38,822 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 136 transitions. [2025-01-09 13:00:38,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 13:00:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 136 transitions. [2025-01-09 13:00:38,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 13:00:38,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:38,825 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:38,832 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:00:39,025 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:00:39,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:39,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:39,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1037844516, now seen corresponding path program 1 times [2025-01-09 13:00:39,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:39,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892632882] [2025-01-09 13:00:39,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:39,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:39,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 13:00:39,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 13:00:39,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:39,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 13:00:39,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:39,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892632882] [2025-01-09 13:00:39,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892632882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:39,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:00:39,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:00:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046056467] [2025-01-09 13:00:39,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:39,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:00:39,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:39,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:00:39,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:00:39,457 INFO L87 Difference]: Start difference. First operand 88 states and 136 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:00:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:39,598 INFO L93 Difference]: Finished difference Result 204 states and 315 transitions. [2025-01-09 13:00:39,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:00:39,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 178 [2025-01-09 13:00:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:39,602 INFO L225 Difference]: With dead ends: 204 [2025-01-09 13:00:39,602 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 13:00:39,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:00:39,603 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 69 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:39,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 295 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:00:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 13:00:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-01-09 13:00:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 73 states have internal predecessors, (94), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 13:00:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 180 transitions. [2025-01-09 13:00:39,626 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 180 transitions. Word has length 178 [2025-01-09 13:00:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:39,626 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 180 transitions. [2025-01-09 13:00:39,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:00:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 180 transitions. [2025-01-09 13:00:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 13:00:39,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:39,630 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:39,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:00:39,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:39,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:39,631 INFO L85 PathProgramCache]: Analyzing trace with hash 510092276, now seen corresponding path program 1 times [2025-01-09 13:00:39,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:39,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081985563] [2025-01-09 13:00:39,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:39,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:39,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 13:00:39,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 13:00:39,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:39,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 13:00:40,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:40,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081985563] [2025-01-09 13:00:40,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081985563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:40,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:00:40,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:00:40,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969572147] [2025-01-09 13:00:40,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:40,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:00:40,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:40,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:00:40,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:00:40,265 INFO L87 Difference]: Start difference. First operand 118 states and 180 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:00:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:40,578 INFO L93 Difference]: Finished difference Result 285 states and 430 transitions. [2025-01-09 13:00:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:00:40,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-01-09 13:00:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:40,581 INFO L225 Difference]: With dead ends: 285 [2025-01-09 13:00:40,581 INFO L226 Difference]: Without dead ends: 196 [2025-01-09 13:00:40,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:00:40,582 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 152 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:40,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 565 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:00:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-01-09 13:00:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 168. [2025-01-09 13:00:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 110 states have internal predecessors, (151), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 13:00:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 259 transitions. [2025-01-09 13:00:40,608 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 259 transitions. Word has length 179 [2025-01-09 13:00:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:40,609 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 259 transitions. [2025-01-09 13:00:40,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:00:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 259 transitions. [2025-01-09 13:00:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 13:00:40,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:40,611 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:40,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:00:40,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:40,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:40,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1190150646, now seen corresponding path program 1 times [2025-01-09 13:00:40,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:40,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129574948] [2025-01-09 13:00:40,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:40,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:40,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 13:00:40,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 13:00:40,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:40,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:00:40,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143982210] [2025-01-09 13:00:40,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:40,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:00:40,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:00:40,724 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:00:40,726 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:00:40,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 13:00:40,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 13:00:40,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:40,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:40,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 13:00:40,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:00:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 13:00:42,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:00:42,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:42,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129574948] [2025-01-09 13:00:42,284 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 13:00:42,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143982210] [2025-01-09 13:00:42,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143982210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:42,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:00:42,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:00:42,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454667854] [2025-01-09 13:00:42,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:42,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:00:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:42,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:00:42,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:00:42,286 INFO L87 Difference]: Start difference. First operand 168 states and 259 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:00:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:42,696 INFO L93 Difference]: Finished difference Result 569 states and 873 transitions. [2025-01-09 13:00:42,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:00:42,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-01-09 13:00:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:42,700 INFO L225 Difference]: With dead ends: 569 [2025-01-09 13:00:42,700 INFO L226 Difference]: Without dead ends: 471 [2025-01-09 13:00:42,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:00:42,703 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 428 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:42,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 587 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:00:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-01-09 13:00:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 423. [2025-01-09 13:00:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 326 states have (on average 1.460122699386503) internal successors, (476), 328 states have internal predecessors, (476), 89 states have call successors, (89), 7 states have call predecessors, (89), 7 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2025-01-09 13:00:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 654 transitions. [2025-01-09 13:00:42,746 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 654 transitions. Word has length 179 [2025-01-09 13:00:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:42,747 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 654 transitions. [2025-01-09 13:00:42,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:00:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 654 transitions. [2025-01-09 13:00:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 13:00:42,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:42,748 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:42,755 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:00:42,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:00:42,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:42,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:42,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1448316084, now seen corresponding path program 1 times [2025-01-09 13:00:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:42,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259209064] [2025-01-09 13:00:42,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:42,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:42,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 13:00:43,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 13:00:43,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:43,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:00:43,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283823988] [2025-01-09 13:00:43,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:43,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:00:43,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:00:43,063 INFO L229 MonitoredProcess]: Starting monitored process 4 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:00:43,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 13:00:43,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 13:00:43,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 13:00:43,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:43,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:43,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 13:00:43,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:00:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 647 proven. 27 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2025-01-09 13:00:43,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:00:43,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:43,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259209064] [2025-01-09 13:00:43,870 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 13:00:43,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283823988] [2025-01-09 13:00:43,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283823988] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:00:43,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:00:43,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-01-09 13:00:43,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808702674] [2025-01-09 13:00:43,871 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 13:00:43,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 13:00:43,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:43,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 13:00:43,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:00:43,872 INFO L87 Difference]: Start difference. First operand 423 states and 654 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-01-09 13:00:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:45,051 INFO L93 Difference]: Finished difference Result 1268 states and 1899 transitions. [2025-01-09 13:00:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 13:00:45,054 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 179 [2025-01-09 13:00:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:45,059 INFO L225 Difference]: With dead ends: 1268 [2025-01-09 13:00:45,059 INFO L226 Difference]: Without dead ends: 975 [2025-01-09 13:00:45,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=940, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 13:00:45,060 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 349 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:45,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1184 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 13:00:45,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-01-09 13:00:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 612. [2025-01-09 13:00:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 475 states have (on average 1.4421052631578948) internal successors, (685), 478 states have internal predecessors, (685), 120 states have call successors, (120), 16 states have call predecessors, (120), 16 states have return successors, (120), 117 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 13:00:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 925 transitions. [2025-01-09 13:00:45,110 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 925 transitions. Word has length 179 [2025-01-09 13:00:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:45,110 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 925 transitions. [2025-01-09 13:00:45,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-01-09 13:00:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 925 transitions. [2025-01-09 13:00:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 13:00:45,112 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:45,112 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:45,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 13:00:45,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:00:45,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:45,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash -240627658, now seen corresponding path program 1 times [2025-01-09 13:00:45,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:45,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755181212] [2025-01-09 13:00:45,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:45,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:45,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 13:00:45,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 13:00:45,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:45,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:00:45,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939908321] [2025-01-09 13:00:45,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:45,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:00:45,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:00:45,400 INFO L229 MonitoredProcess]: Starting monitored process 5 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:00:45,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 13:00:45,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 13:00:45,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 13:00:45,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:45,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:00:45,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:00:45,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 13:00:45,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 13:00:45,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:45,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:00:45,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:00:45,763 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:00:45,763 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:00:45,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 13:00:45,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 13:00:45,967 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 13:00:46,059 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:00:46,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:00:46 BoogieIcfgContainer [2025-01-09 13:00:46,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:00:46,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:00:46,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:00:46,065 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:00:46,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:00:38" (3/4) ... [2025-01-09 13:00:46,067 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:00:46,067 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:00:46,068 INFO L158 Benchmark]: Toolchain (without parser) took 8575.95ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 111.3MB in the beginning and 185.0MB in the end (delta: -73.6MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2025-01-09 13:00:46,068 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:00:46,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.70ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 93.9MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:00:46,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.97ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 87.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:00:46,069 INFO L158 Benchmark]: Boogie Preprocessor took 64.49ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 77.8MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:00:46,069 INFO L158 Benchmark]: RCFGBuilder took 405.76ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 46.0MB in the end (delta: 31.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 13:00:46,070 INFO L158 Benchmark]: TraceAbstraction took 7789.78ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 45.5MB in the beginning and 185.0MB in the end (delta: -139.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:00:46,070 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 268.4MB. Free memory was 185.0MB in the beginning and 185.0MB in the end (delta: 35.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:00:46,071 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.70ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 93.9MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.97ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 87.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.49ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 77.8MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 405.76ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 46.0MB in the end (delta: 31.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7789.78ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 45.5MB in the beginning and 185.0MB in the end (delta: -139.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 268.4MB. Free memory was 185.0MB in the beginning and 185.0MB in the end (delta: 35.2kB). 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 someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someUnaryDOUBLEoperation at line 22, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = -0.25; [L23] double var_1_2 = -0.125; [L24] double var_1_3 = 127.5; [L25] unsigned char var_1_4 = 4; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 10; [L28] float var_1_7 = -0.2; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 1; [L32] unsigned char var_1_12 = 0; [L33] unsigned char var_1_13 = 0; [L34] unsigned char var_1_14 = 0; [L35] signed long int var_1_15 = -100000; [L36] signed char var_1_18 = 8; [L37] signed char var_1_19 = 64; [L38] signed short int var_1_20 = -16; [L39] signed long int var_1_22 = -1; [L40] double var_1_23 = 500.8; [L41] double var_1_24 = 9.8; [L42] unsigned short int var_1_25 = 16; [L43] unsigned short int var_1_26 = 41277; [L44] signed long int var_1_27 = 1000; [L45] double var_1_29 = 99.5; [L46] double var_1_30 = 99999999.6; [L47] unsigned long int var_1_31 = 4; [L48] unsigned short int var_1_32 = 10; [L49] unsigned short int var_1_33 = 52075; [L50] unsigned char last_1_var_1_4 = 4; [L51] unsigned char last_1_var_1_9 = 0; [L52] signed long int last_1_var_1_15 = -100000; [L53] signed short int last_1_var_1_20 = -16; [L54] signed long int last_1_var_1_22 = -1; [L55] unsigned short int last_1_var_1_32 = 10; VAL [isInitial=0, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L192] isInitial = 1 [L193] FCALL initially() [L194] int k_loop; [L195] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L195] COND TRUE k_loop < 1 [L196] CALL updateLastVariables() [L180] last_1_var_1_4 = var_1_4 [L181] last_1_var_1_9 = var_1_9 [L182] last_1_var_1_15 = var_1_15 [L183] last_1_var_1_20 = var_1_20 [L184] last_1_var_1_22 = var_1_22 [L185] last_1_var_1_32 = var_1_32 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_2 >= -461168.6018427382800e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 4611686.018427382800e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L137] RET assume_abort_if_not((var_1_2 >= -461168.6018427382800e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 4611686.018427382800e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L138] var_1_3 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L139] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L140] var_1_5 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L141] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L142] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L143] var_1_6 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L144] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L145] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L146] var_1_10 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L147] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L149] var_1_11 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L150] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L152] var_1_12 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L159] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L160] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L161] var_1_19 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L162] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L163] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L164] var_1_24 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L165] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L166] var_1_26 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_26 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L167] RET assume_abort_if_not(var_1_26 >= 32767) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_26 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L168] RET assume_abort_if_not(var_1_26 <= 65535) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L169] var_1_27 = __VERIFIER_nondet_long() [L170] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L170] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L171] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L171] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L172] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L173] var_1_30 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L174] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L175] var_1_33 = __VERIFIER_nondet_ushort() [L176] CALL assume_abort_if_not(var_1_33 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=-81921, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=-81921, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L176] RET assume_abort_if_not(var_1_33 >= 49150) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=-81921, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=-81921, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=-81921, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L177] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=-81921, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L197] RET updateVariables() [L198] CALL step() [L59] signed long int stepLocal_7 = ((((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) < 0 ) ? -((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) : ((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4)))); VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_7=4, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=-81921, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L60] COND TRUE stepLocal_7 >= ((last_1_var_1_22 * var_1_6) * last_1_var_1_15) [L61] var_1_31 = (last_1_var_1_32 + (1891941459u - last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L65] COND FALSE !(\read(last_1_var_1_9)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=199/2, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L68] var_1_1 = ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) [L69] var_1_29 = ((((((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) > (var_1_30)) ? (((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) : (var_1_30))) [L70] unsigned char stepLocal_2 = var_1_10; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L71] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L80] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L85] COND FALSE !((var_1_26 - var_1_32) <= (var_1_19 % var_1_27)) [L88] var_1_25 = ((((((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) > (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4))))) ? (((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) : (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4)))))) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L90] unsigned char stepLocal_1 = var_1_6 <= var_1_31; [L91] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_0=0, stepLocal_1=1, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L92] COND FALSE !(stepLocal_0 > (var_1_25 * var_1_31)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L97] COND FALSE !(var_1_3 <= (- var_1_7)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L102] unsigned char stepLocal_3 = var_1_9; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L103] COND FALSE !(var_1_3 != var_1_29) [L110] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L112] EXPR var_1_4 >> var_1_18 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L112] COND FALSE !(var_1_6 >= (var_1_4 >> var_1_18)) [L115] signed char stepLocal_5 = var_1_18; [L116] signed char stepLocal_4 = var_1_18; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L117] COND FALSE !(stepLocal_5 < var_1_19) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L120] COND FALSE !(((((last_1_var_1_20) < (var_1_6)) ? (last_1_var_1_20) : (var_1_6))) == stepLocal_4) [L123] var_1_20 = -10 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L126] signed short int stepLocal_6 = var_1_20; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_6=-10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L127] COND FALSE !(stepLocal_6 > ((((var_1_20) > (var_1_19)) ? (var_1_20) : (var_1_19)))) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L198] RET step() [L199] CALL, EXPR property() [L188] EXPR ((((var_1_1 == ((double) ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))))) && (var_1_9 ? ((var_1_3 <= ((((499.25) < (999999.3)) ? (499.25) : (999999.3)))) ? (var_1_4 == ((unsigned char) var_1_6)) : 1) : 1)) && ((var_1_6 > (var_1_25 * var_1_31)) ? (((var_1_6 <= var_1_31) && var_1_9) ? (var_1_7 == ((float) var_1_3)) : 1) : 1)) && (var_1_5 ? ((var_1_11 || var_1_10) ? ((! (var_1_29 < var_1_2)) ? (var_1_9 == ((unsigned char) (var_1_12 || var_1_13))) : (var_1_9 == ((unsigned char) (var_1_11 && ((var_1_12 && var_1_13) || (! var_1_14)))))) : 1) : 1)) && ((var_1_6 >= (var_1_4 >> var_1_18)) ? (var_1_15 == ((signed long int) (((((var_1_4 + var_1_32)) < ((var_1_18 + (var_1_6 + var_1_18)))) ? ((var_1_4 + var_1_32)) : ((var_1_18 + (var_1_6 + var_1_18))))))) : 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L188-L189] return ((((((((((((var_1_1 == ((double) ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))))) && (var_1_9 ? ((var_1_3 <= ((((499.25) < (999999.3)) ? (499.25) : (999999.3)))) ? (var_1_4 == ((unsigned char) var_1_6)) : 1) : 1)) && ((var_1_6 > (var_1_25 * var_1_31)) ? (((var_1_6 <= var_1_31) && var_1_9) ? (var_1_7 == ((float) var_1_3)) : 1) : 1)) && (var_1_5 ? ((var_1_11 || var_1_10) ? ((! (var_1_29 < var_1_2)) ? (var_1_9 == ((unsigned char) (var_1_12 || var_1_13))) : (var_1_9 == ((unsigned char) (var_1_11 && ((var_1_12 && var_1_13) || (! var_1_14)))))) : 1) : 1)) && ((var_1_6 >= (var_1_4 >> var_1_18)) ? (var_1_15 == ((signed long int) (((((var_1_4 + var_1_32)) < ((var_1_18 + (var_1_6 + var_1_18)))) ? ((var_1_4 + var_1_32)) : ((var_1_18 + (var_1_6 + var_1_18))))))) : 1)) && ((var_1_3 != var_1_29) ? (((var_1_32 <= var_1_31) && var_1_9) ? (var_1_18 == ((signed char) var_1_19)) : (var_1_18 == ((signed char) var_1_19))) : (var_1_18 == ((signed char) var_1_19)))) && ((var_1_18 < var_1_19) ? (var_1_20 == ((signed short int) (var_1_31 + var_1_19))) : ((((((last_1_var_1_20) < (var_1_6)) ? (last_1_var_1_20) : (var_1_6))) == var_1_18) ? (var_1_20 == ((signed short int) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_20 == ((signed short int) -10))))) && ((var_1_20 > ((((var_1_20) > (var_1_19)) ? (var_1_20) : (var_1_19)))) ? ((! var_1_12) ? (var_1_22 == ((signed long int) (var_1_31 - var_1_20))) : (var_1_22 == ((signed long int) 2))) : 1)) && ((var_1_3 <= (- var_1_7)) ? (var_1_9 ? (var_1_23 == ((double) (var_1_24 - 31.25))) : 1) : 1)) && (((var_1_26 - var_1_32) <= (var_1_19 % var_1_27)) ? (var_1_25 == ((unsigned short int) ((((var_1_6) > (((((var_1_32) > (var_1_32)) ? (var_1_32) : (var_1_32))))) ? (var_1_6) : (((((var_1_32) > (var_1_32)) ? (var_1_32) : (var_1_32)))))))) : (var_1_25 == ((unsigned short int) ((((((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) > (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4))))) ? (((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) : (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4)))))))))) && (var_1_29 == ((double) ((((((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) > (var_1_30)) ? (((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) : (var_1_30)))))) && (((((((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) < 0 ) ? -((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) : ((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))))) >= ((last_1_var_1_22 * var_1_6) * last_1_var_1_15)) ? (var_1_31 == ((unsigned long int) (last_1_var_1_32 + (1891941459u - last_1_var_1_15)))) : (var_1_31 == ((unsigned long int) ((((((((last_1_var_1_15) < (last_1_var_1_4)) ? (last_1_var_1_15) : (last_1_var_1_4)))) > (var_1_26)) ? (((((last_1_var_1_15) < (last_1_var_1_4)) ? (last_1_var_1_15) : (last_1_var_1_4)))) : (var_1_26))))))) && (last_1_var_1_9 ? (var_1_32 == ((unsigned short int) ((var_1_33 - last_1_var_1_15) - var_1_6))) : 1) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-81921, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 6, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1017 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 998 mSDsluCounter, 2770 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2034 mSDsCounter, 245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1524 IncrementalHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 245 mSolverCounterUnsat, 736 mSDtfsCounter, 1524 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 623 GetRequests, 566 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=612occurred in iteration=5, InterpolantAutomatonStates: 53, 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, 5 MinimizatonAttempts, 440 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1787 NumberOfCodeBlocks, 1787 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1065 ConstructedInterpolants, 6 QuantifiedInterpolants, 5739 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1272 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 8345/8424 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:00:46,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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-1loop_file-94.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 211883c60ce0bb06b72e4a9000b7135ce379464c60607038b1e2cd858553e4b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:00:47,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:00:48,078 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:00:48,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:00:48,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:00:48,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:00:48,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:00:48,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:00:48,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:00:48,111 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:00:48,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:00:48,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:00:48,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:00:48,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:00:48,113 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:00:48,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:00:48,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:00:48,113 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:00:48,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:00:48,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:00:48,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:00:48,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:00:48,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:00:48,114 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:00:48,114 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:00:48,114 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:00:48,114 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:00:48,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:00:48,115 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:00:48,115 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:00:48,115 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:00:48,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:00:48,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:00:48,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:00:48,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:00:48,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:00:48,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:00:48,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:00:48,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:00:48,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:00:48,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:00:48,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:00:48,116 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:00:48,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:00:48,116 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:00:48,116 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:00:48,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:00:48,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:00:48,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:00:48,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:00:48,116 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 -> 211883c60ce0bb06b72e4a9000b7135ce379464c60607038b1e2cd858553e4b3 [2025-01-09 13:00:48,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:00:48,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:00:48,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:00:48,332 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:00:48,332 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:00:48,333 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-1loop_file-94.i [2025-01-09 13:00:49,561 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77202ce74/fff189e8a4c34970944a7efc7731dd75/FLAG4f6c5b087 [2025-01-09 13:00:49,771 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:00:49,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-94.i [2025-01-09 13:00:49,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77202ce74/fff189e8a4c34970944a7efc7731dd75/FLAG4f6c5b087 [2025-01-09 13:00:49,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77202ce74/fff189e8a4c34970944a7efc7731dd75 [2025-01-09 13:00:49,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:00:49,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:00:49,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:00:49,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:00:49,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:00:49,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:00:49" (1/1) ... [2025-01-09 13:00:49,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f770e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:49, skipping insertion in model container [2025-01-09 13:00:49,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:00:49" (1/1) ... [2025-01-09 13:00:49,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:00:49,885 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-1loop_file-94.i[916,929] [2025-01-09 13:00:49,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:00:49,955 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:00:49,962 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-1loop_file-94.i[916,929] [2025-01-09 13:00:50,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:00:50,028 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:00:50,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:50 WrapperNode [2025-01-09 13:00:50,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:00:50,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:00:50,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:00:50,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:00:50,040 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:00:50" (1/1) ... [2025-01-09 13:00:50,053 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:00:50" (1/1) ... [2025-01-09 13:00:50,079 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2025-01-09 13:00:50,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:00:50,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:00:50,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:00:50,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:00:50,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:50" (1/1) ... [2025-01-09 13:00:50,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:50" (1/1) ... [2025-01-09 13:00:50,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:50" (1/1) ... [2025-01-09 13:00:50,112 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:00:50,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:50" (1/1) ... [2025-01-09 13:00:50,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:50" (1/1) ... [2025-01-09 13:00:50,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:50" (1/1) ... [2025-01-09 13:00:50,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:50" (1/1) ... [2025-01-09 13:00:50,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:50" (1/1) ... [2025-01-09 13:00:50,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:50" (1/1) ... [2025-01-09 13:00:50,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:50" (1/1) ... [2025-01-09 13:00:50,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:00:50,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:00:50,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:00:50,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:00:50,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:50" (1/1) ... [2025-01-09 13:00:50,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:00:50,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:00:50,168 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:00:50,172 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:00:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:00:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:00:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:00:50,188 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:00:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:00:50,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:00:50,244 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:00:50,245 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:00:52,759 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-09 13:00:52,759 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:00:52,766 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:00:52,766 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:00:52,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:00:52 BoogieIcfgContainer [2025-01-09 13:00:52,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:00:52,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:00:52,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:00:52,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:00:52,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:00:49" (1/3) ... [2025-01-09 13:00:52,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778f1f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:00:52, skipping insertion in model container [2025-01-09 13:00:52,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:00:50" (2/3) ... [2025-01-09 13:00:52,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778f1f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:00:52, skipping insertion in model container [2025-01-09 13:00:52,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:00:52" (3/3) ... [2025-01-09 13:00:52,774 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-94.i [2025-01-09 13:00:52,785 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:00:52,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-94.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:00:52,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:00:52,875 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;@3200e024, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:00:52,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:00:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 55 states have internal predecessors, (77), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 13:00:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 13:00:52,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:52,888 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:52,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:52,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash -350819203, now seen corresponding path program 1 times [2025-01-09 13:00:52,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:00:52,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122060198] [2025-01-09 13:00:52,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:52,900 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:00:52,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:00:52,902 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:00:52,904 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:00:52,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 13:00:53,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 13:00:53,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:53,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:53,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:00:53,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:00:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 472 proven. 0 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2025-01-09 13:00:53,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:00:53,362 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:00:53,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122060198] [2025-01-09 13:00:53,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122060198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:53,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:00:53,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:00:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147864999] [2025-01-09 13:00:53,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:53,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:00:53,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:00:53,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:00:53,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:00:53,388 INFO L87 Difference]: Start difference. First operand has 84 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 55 states have internal predecessors, (77), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) 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, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 13:00:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:53,410 INFO L93 Difference]: Finished difference Result 165 states and 286 transitions. [2025-01-09 13:00:53,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:00:53,412 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, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-01-09 13:00:53,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:53,416 INFO L225 Difference]: With dead ends: 165 [2025-01-09 13:00:53,416 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 13:00:53,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 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:00:53,421 INFO L435 NwaCegarLoop]: 129 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, 129 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:00:53,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:00:53,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 13:00:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 13:00:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 13:00:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2025-01-09 13:00:53,462 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 175 [2025-01-09 13:00:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:53,462 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2025-01-09 13:00:53,463 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, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 13:00:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2025-01-09 13:00:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 13:00:53,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:53,469 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:53,493 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 (2)] Ended with exit code 0 [2025-01-09 13:00:53,673 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:00:53,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:53,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash 895923067, now seen corresponding path program 1 times [2025-01-09 13:00:53,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:00:53,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257171886] [2025-01-09 13:00:53,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:53,676 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:00:53,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:00:53,679 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:00:53,680 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:00:53,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 13:00:54,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 13:00:54,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:54,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:54,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 13:00:54,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:00:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 13:00:54,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:00:54,917 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:00:54,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257171886] [2025-01-09 13:00:54,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257171886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:54,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:00:54,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:00:54,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325603875] [2025-01-09 13:00:54,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:54,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:00:54,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:00:54,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:00:54,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:00:54,920 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:00:58,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:00:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:59,985 INFO L93 Difference]: Finished difference Result 311 states and 480 transitions. [2025-01-09 13:00:59,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:00:59,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 13:00:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:59,991 INFO L225 Difference]: With dead ends: 311 [2025-01-09 13:00:59,991 INFO L226 Difference]: Without dead ends: 233 [2025-01-09 13:00:59,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:00:59,995 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 136 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:59,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 632 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-09 13:01:00,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-01-09 13:01:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 189. [2025-01-09 13:01:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 115 states have (on average 1.3478260869565217) internal successors, (155), 116 states have internal predecessors, (155), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 13:01:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 295 transitions. [2025-01-09 13:01:00,052 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 295 transitions. Word has length 175 [2025-01-09 13:01:00,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:01:00,053 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 295 transitions. [2025-01-09 13:01:00,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:01:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 295 transitions. [2025-01-09 13:01:00,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 13:01:00,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:01:00,057 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:00,077 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 (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:01:00,258 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:01:00,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:01:00,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:01:00,259 INFO L85 PathProgramCache]: Analyzing trace with hash 215864697, now seen corresponding path program 1 times [2025-01-09 13:01:00,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:01:00,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540926406] [2025-01-09 13:01:00,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:01:00,260 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:01:00,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:01:00,264 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:01:00,264 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:01:00,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 13:01:00,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 13:01:00,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:01:00,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:01:00,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 13:01:00,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:01:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 13:01:00,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:01:00,718 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:01:00,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540926406] [2025-01-09 13:01:00,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540926406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:01:00,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:01:00,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:01:00,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454027919] [2025-01-09 13:01:00,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:01:00,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:01:00,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:01:00,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:01:00,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:01:00,719 INFO L87 Difference]: Start difference. First operand 189 states and 295 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:01:02,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:01:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:01:02,736 INFO L93 Difference]: Finished difference Result 354 states and 549 transitions. [2025-01-09 13:01:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:01:02,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 13:01:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:01:02,738 INFO L225 Difference]: With dead ends: 354 [2025-01-09 13:01:02,738 INFO L226 Difference]: Without dead ends: 194 [2025-01-09 13:01:02,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:01:02,740 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 61 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:01:02,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 382 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 13:01:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-09 13:01:02,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2025-01-09 13:01:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 117 states have internal predecessors, (154), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 13:01:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 294 transitions. [2025-01-09 13:01:02,776 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 294 transitions. Word has length 175 [2025-01-09 13:01:02,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:01:02,777 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 294 transitions. [2025-01-09 13:01:02,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:01:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 294 transitions. [2025-01-09 13:01:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 13:01:02,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:01:02,780 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:02,794 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 (4)] Ended with exit code 0 [2025-01-09 13:01:02,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:01:02,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:01:02,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:01:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1622587196, now seen corresponding path program 1 times [2025-01-09 13:01:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:01:02,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583424526] [2025-01-09 13:01:02,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:01:02,987 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:01:02,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:01:02,989 INFO L229 MonitoredProcess]: Starting monitored process 5 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:01:02,990 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 (5)] Waiting until timeout for monitored process [2025-01-09 13:01:03,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 13:01:03,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 13:01:03,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:01:03,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:01:03,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:01:03,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:01:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 13:01:04,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:01:04,834 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:01:04,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583424526] [2025-01-09 13:01:04,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583424526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:01:04,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:01:04,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:01:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333622591] [2025-01-09 13:01:04,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:01:04,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:01:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:01:04,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:01:04,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:01:04,835 INFO L87 Difference]: Start difference. First operand 191 states and 294 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:01:08,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:01:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:01:08,712 INFO L93 Difference]: Finished difference Result 419 states and 640 transitions. [2025-01-09 13:01:08,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:01:08,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-01-09 13:01:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:01:08,715 INFO L225 Difference]: With dead ends: 419 [2025-01-09 13:01:08,715 INFO L226 Difference]: Without dead ends: 257 [2025-01-09 13:01:08,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:01:08,718 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 122 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-09 13:01:08,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 447 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-09 13:01:08,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-01-09 13:01:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 154. [2025-01-09 13:01:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 13:01:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 238 transitions. [2025-01-09 13:01:08,747 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 238 transitions. Word has length 176 [2025-01-09 13:01:08,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:01:08,748 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 238 transitions. [2025-01-09 13:01:08,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:01:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 238 transitions. [2025-01-09 13:01:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 13:01:08,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:01:08,750 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:08,774 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 (5)] Ended with exit code 0 [2025-01-09 13:01:08,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:01:08,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:01:08,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:01:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash -897372738, now seen corresponding path program 1 times [2025-01-09 13:01:08,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:01:08,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821206268] [2025-01-09 13:01:08,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:01:08,951 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:01:08,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:01:08,954 INFO L229 MonitoredProcess]: Starting monitored process 6 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:01:08,955 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 (6)] Waiting until timeout for monitored process [2025-01-09 13:01:08,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 13:01:09,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 13:01:09,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:01:09,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:01:09,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 13:01:09,341 INFO L279 TraceCheckSpWp]: Computing forward predicates...