./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-44.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-44.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 adb5fb4d805ca2a5692f9b69f128d488862bca1b1bd46cb53a0587439b8a768f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:53:33,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:53:33,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:53:33,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:53:33,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:53:33,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:53:33,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:53:33,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:53:33,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:53:33,470 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:53:33,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:53:33,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:53:33,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:53:33,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:53:33,470 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:53:33,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:53:33,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:53:33,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:53:33,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:53:33,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:53:33,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:53:33,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:53:33,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:53:33,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:53:33,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:53:33,472 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:53:33,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:53:33,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:53:33,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:53:33,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:53:33,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:53:33,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:53:33,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:53:33,472 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 -> adb5fb4d805ca2a5692f9b69f128d488862bca1b1bd46cb53a0587439b8a768f [2025-01-09 12:53:33,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:53:33,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:53:33,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:53:33,660 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:53:33,660 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:53:33,661 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-44.i [2025-01-09 12:53:34,782 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1eb3fa9bd/8b796ba7db8f47159212c315aa2e5ee4/FLAGb4a9a35a6 [2025-01-09 12:53:35,074 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:53:35,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-44.i [2025-01-09 12:53:35,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1eb3fa9bd/8b796ba7db8f47159212c315aa2e5ee4/FLAGb4a9a35a6 [2025-01-09 12:53:35,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1eb3fa9bd/8b796ba7db8f47159212c315aa2e5ee4 [2025-01-09 12:53:35,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:53:35,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:53:35,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:53:35,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:53:35,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:53:35,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,116 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 12:53:35, skipping insertion in model container [2025-01-09 12:53:35,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:53:35,257 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-44.i[916,929] [2025-01-09 12:53:35,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:53:35,344 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:53:35,353 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-44.i[916,929] [2025-01-09 12:53:35,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:53:35,409 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:53:35,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35 WrapperNode [2025-01-09 12:53:35,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:53:35,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:53:35,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:53:35,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:53:35,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,466 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 343 [2025-01-09 12:53:35,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:53:35,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:53:35,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:53:35,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:53:35,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,510 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 12:53:35,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,525 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:53:35,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:53:35,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:53:35,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:53:35,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35" (1/1) ... [2025-01-09 12:53:35,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:53:35,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:53:35,569 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 12:53:35,571 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 12:53:35,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:53:35,587 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:53:35,587 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:53:35,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:53:35,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:53:35,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:53:35,648 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:53:35,649 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:53:36,075 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-01-09 12:53:36,075 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:53:36,082 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:53:36,082 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:53:36,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:53:36 BoogieIcfgContainer [2025-01-09 12:53:36,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:53:36,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:53:36,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:53:36,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:53:36,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:53:35" (1/3) ... [2025-01-09 12:53:36,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e22bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:53:36, skipping insertion in model container [2025-01-09 12:53:36,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:35" (2/3) ... [2025-01-09 12:53:36,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e22bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:53:36, skipping insertion in model container [2025-01-09 12:53:36,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:53:36" (3/3) ... [2025-01-09 12:53:36,091 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-44.i [2025-01-09 12:53:36,101 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:53:36,103 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-44.i that has 2 procedures, 144 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:53:36,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:53:36,157 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;@28959341, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:53:36,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:53:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 109 states have internal predecessors, (153), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:53:36,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 12:53:36,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:53:36,169 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:36,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:53:36,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:53:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2121259784, now seen corresponding path program 1 times [2025-01-09 12:53:36,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:53:36,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440453791] [2025-01-09 12:53:36,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:53:36,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:53:36,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 12:53:36,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 12:53:36,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:36,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:53:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-01-09 12:53:36,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:53:36,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440453791] [2025-01-09 12:53:36,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440453791] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:53:36,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119037347] [2025-01-09 12:53:36,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:53:36,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:53:36,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:53:36,506 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 12:53:36,510 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 12:53:36,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 12:53:36,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 12:53:36,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:36,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:53:36,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:53:36,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:53:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-01-09 12:53:36,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:53:36,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119037347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:53:36,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:53:36,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:53:36,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235065127] [2025-01-09 12:53:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:53:36,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:53:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:53:36,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:53:36,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:53:36,730 INFO L87 Difference]: Start difference. First operand has 144 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 109 states have internal predecessors, (153), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 12:53:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:53:36,762 INFO L93 Difference]: Finished difference Result 280 states and 460 transitions. [2025-01-09 12:53:36,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:53:36,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 219 [2025-01-09 12:53:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:53:36,768 INFO L225 Difference]: With dead ends: 280 [2025-01-09 12:53:36,769 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 12:53:36,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 220 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 12:53:36,776 INFO L435 NwaCegarLoop]: 207 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, 207 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 12:53:36,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:53:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 12:53:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-01-09 12:53:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:53:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 204 transitions. [2025-01-09 12:53:36,816 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 204 transitions. Word has length 219 [2025-01-09 12:53:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:53:36,817 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 204 transitions. [2025-01-09 12:53:36,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 12:53:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 204 transitions. [2025-01-09 12:53:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 12:53:36,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:53:36,821 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:36,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:53:37,022 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 12:53:37,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:53:37,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:53:37,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1742298038, now seen corresponding path program 1 times [2025-01-09 12:53:37,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:53:37,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208158264] [2025-01-09 12:53:37,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:53:37,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:53:37,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 12:53:37,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 12:53:37,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:37,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:53:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:53:38,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:53:38,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208158264] [2025-01-09 12:53:38,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208158264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:53:38,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:53:38,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:53:38,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908235845] [2025-01-09 12:53:38,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:53:38,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:53:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:53:38,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:53:38,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:53:38,182 INFO L87 Difference]: Start difference. First operand 136 states and 204 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 12:53:38,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:53:38,434 INFO L93 Difference]: Finished difference Result 281 states and 420 transitions. [2025-01-09 12:53:38,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:53:38,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 219 [2025-01-09 12:53:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:53:38,437 INFO L225 Difference]: With dead ends: 281 [2025-01-09 12:53:38,437 INFO L226 Difference]: Without dead ends: 148 [2025-01-09 12:53:38,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:53:38,438 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 262 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:53:38,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 211 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:53:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-09 12:53:38,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2025-01-09 12:53:38,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 12:53:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 215 transitions. [2025-01-09 12:53:38,453 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 215 transitions. Word has length 219 [2025-01-09 12:53:38,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:53:38,454 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 215 transitions. [2025-01-09 12:53:38,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 12:53:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 215 transitions. [2025-01-09 12:53:38,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 12:53:38,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:53:38,457 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:38,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:53:38,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:53:38,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:53:38,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1804337652, now seen corresponding path program 1 times [2025-01-09 12:53:38,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:53:38,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979826621] [2025-01-09 12:53:38,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:53:38,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:53:38,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 12:53:38,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 12:53:38,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:38,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:53:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:53:38,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:53:38,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979826621] [2025-01-09 12:53:38,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979826621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:53:38,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:53:38,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:53:38,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029477981] [2025-01-09 12:53:38,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:53:38,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:53:38,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:53:38,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:53:38,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:53:38,639 INFO L87 Difference]: Start difference. First operand 147 states and 215 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:53:38,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:53:38,653 INFO L93 Difference]: Finished difference Result 284 states and 416 transitions. [2025-01-09 12:53:38,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:53:38,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 219 [2025-01-09 12:53:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:53:38,656 INFO L225 Difference]: With dead ends: 284 [2025-01-09 12:53:38,657 INFO L226 Difference]: Without dead ends: 147 [2025-01-09 12:53:38,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:53:38,658 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:53:38,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 197 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:53:38,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-09 12:53:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-01-09 12:53:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 107 states have (on average 1.308411214953271) internal successors, (140), 108 states have internal predecessors, (140), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 12:53:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 214 transitions. [2025-01-09 12:53:38,676 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 214 transitions. Word has length 219 [2025-01-09 12:53:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:53:38,676 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 214 transitions. [2025-01-09 12:53:38,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:53:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 214 transitions. [2025-01-09 12:53:38,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 12:53:38,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:53:38,682 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:38,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:53:38,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:53:38,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:53:38,683 INFO L85 PathProgramCache]: Analyzing trace with hash -66697794, now seen corresponding path program 1 times [2025-01-09 12:53:38,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:53:38,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724912144] [2025-01-09 12:53:38,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:53:38,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:53:38,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 12:53:38,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 12:53:38,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:38,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:53:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:53:38,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:53:38,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724912144] [2025-01-09 12:53:38,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724912144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:53:38,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:53:38,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:53:38,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764856435] [2025-01-09 12:53:38,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:53:38,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:53:38,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:53:38,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:53:38,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:53:38,893 INFO L87 Difference]: Start difference. First operand 147 states and 214 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:53:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:53:38,923 INFO L93 Difference]: Finished difference Result 284 states and 414 transitions. [2025-01-09 12:53:38,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:53:38,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 220 [2025-01-09 12:53:38,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:53:38,927 INFO L225 Difference]: With dead ends: 284 [2025-01-09 12:53:38,927 INFO L226 Difference]: Without dead ends: 147 [2025-01-09 12:53:38,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:53:38,929 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:53:38,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:53:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-09 12:53:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-01-09 12:53:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 108 states have internal predecessors, (139), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 12:53:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 213 transitions. [2025-01-09 12:53:38,949 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 213 transitions. Word has length 220 [2025-01-09 12:53:38,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:53:38,949 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 213 transitions. [2025-01-09 12:53:38,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:53:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 213 transitions. [2025-01-09 12:53:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 12:53:38,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:53:38,951 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:38,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:53:38,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:53:38,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:53:38,952 INFO L85 PathProgramCache]: Analyzing trace with hash 152156924, now seen corresponding path program 1 times [2025-01-09 12:53:38,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:53:38,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087639601] [2025-01-09 12:53:38,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:53:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:53:38,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 12:53:39,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 12:53:39,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:39,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:53:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 18 proven. 78 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-01-09 12:53:39,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:53:39,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087639601] [2025-01-09 12:53:39,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087639601] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:53:39,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296086792] [2025-01-09 12:53:39,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:53:39,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:53:39,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:53:39,236 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 12:53:39,237 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 12:53:39,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 12:53:39,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 12:53:39,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:39,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:53:39,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:53:39,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:53:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 668 proven. 78 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2025-01-09 12:53:39,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:53:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 18 proven. 78 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-01-09 12:53:40,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296086792] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:53:40,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:53:40,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 12:53:40,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027968447] [2025-01-09 12:53:40,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:53:40,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:53:40,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:53:40,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:53:40,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:53:40,081 INFO L87 Difference]: Start difference. First operand 147 states and 213 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 12:53:40,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:53:40,336 INFO L93 Difference]: Finished difference Result 298 states and 427 transitions. [2025-01-09 12:53:40,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:53:40,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 220 [2025-01-09 12:53:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:53:40,340 INFO L225 Difference]: With dead ends: 298 [2025-01-09 12:53:40,340 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 12:53:40,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 437 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:53:40,341 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 198 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:53:40,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 434 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:53:40,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 12:53:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2025-01-09 12:53:40,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 112 states have internal predecessors, (141), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 12:53:40,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 219 transitions. [2025-01-09 12:53:40,359 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 219 transitions. Word has length 220 [2025-01-09 12:53:40,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:53:40,360 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 219 transitions. [2025-01-09 12:53:40,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 12:53:40,360 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 219 transitions. [2025-01-09 12:53:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-09 12:53:40,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:53:40,361 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:40,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:53:40,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:53:40,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:53:40,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:53:40,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1847382370, now seen corresponding path program 1 times [2025-01-09 12:53:40,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:53:40,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491020520] [2025-01-09 12:53:40,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:53:40,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:53:40,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 12:53:40,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 12:53:40,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:40,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:53:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:53:40,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:53:40,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491020520] [2025-01-09 12:53:40,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491020520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:53:40,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:53:40,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:53:40,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432669454] [2025-01-09 12:53:40,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:53:40,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:53:40,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:53:40,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:53:40,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:53:40,793 INFO L87 Difference]: Start difference. First operand 154 states and 219 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:53:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:53:41,235 INFO L93 Difference]: Finished difference Result 487 states and 694 transitions. [2025-01-09 12:53:41,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:53:41,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 222 [2025-01-09 12:53:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:53:41,242 INFO L225 Difference]: With dead ends: 487 [2025-01-09 12:53:41,242 INFO L226 Difference]: Without dead ends: 346 [2025-01-09 12:53:41,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:53:41,243 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 497 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:53:41,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 718 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:53:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-01-09 12:53:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 243. [2025-01-09 12:53:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 171 states have (on average 1.263157894736842) internal successors, (216), 172 states have internal predecessors, (216), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 12:53:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 348 transitions. [2025-01-09 12:53:41,275 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 348 transitions. Word has length 222 [2025-01-09 12:53:41,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:53:41,276 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 348 transitions. [2025-01-09 12:53:41,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:53:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 348 transitions. [2025-01-09 12:53:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-09 12:53:41,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:53:41,277 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:41,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:53:41,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:53:41,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:53:41,278 INFO L85 PathProgramCache]: Analyzing trace with hash -524356892, now seen corresponding path program 1 times [2025-01-09 12:53:41,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:53:41,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931814818] [2025-01-09 12:53:41,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:53:41,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:53:41,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 12:53:41,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 12:53:41,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:41,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:53:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:53:41,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:53:41,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931814818] [2025-01-09 12:53:41,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931814818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:53:41,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:53:41,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:53:41,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760401469] [2025-01-09 12:53:41,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:53:41,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:53:41,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:53:41,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:53:41,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:53:41,849 INFO L87 Difference]: Start difference. First operand 243 states and 348 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 12:53:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:53:42,070 INFO L93 Difference]: Finished difference Result 420 states and 599 transitions. [2025-01-09 12:53:42,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:53:42,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 222 [2025-01-09 12:53:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:53:42,073 INFO L225 Difference]: With dead ends: 420 [2025-01-09 12:53:42,074 INFO L226 Difference]: Without dead ends: 243 [2025-01-09 12:53:42,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:53:42,075 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 333 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:53:42,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 200 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:53:42,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-01-09 12:53:42,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 207. [2025-01-09 12:53:42,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 135 states have (on average 1.2074074074074075) internal successors, (163), 136 states have internal predecessors, (163), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 12:53:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 295 transitions. [2025-01-09 12:53:42,097 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 295 transitions. Word has length 222 [2025-01-09 12:53:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:53:42,098 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 295 transitions. [2025-01-09 12:53:42,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 12:53:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 295 transitions. [2025-01-09 12:53:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-09 12:53:42,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:53:42,100 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:42,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:53:42,100 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:53:42,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:53:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash 474149948, now seen corresponding path program 1 times [2025-01-09 12:53:42,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:53:42,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356026574] [2025-01-09 12:53:42,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:53:42,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:53:42,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 12:53:42,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 12:53:42,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:42,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:53:42,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819159924] [2025-01-09 12:53:42,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:53:42,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:53:42,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:53:42,186 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 12:53:42,188 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 12:53:42,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 12:53:42,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 12:53:42,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:42,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:53:42,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 12:53:42,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:53:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:53:42,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:53:42,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:53:42,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356026574] [2025-01-09 12:53:42,422 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:53:42,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819159924] [2025-01-09 12:53:42,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819159924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:53:42,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:53:42,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:53:42,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275978245] [2025-01-09 12:53:42,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:53:42,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:53:42,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:53:42,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:53:42,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:53:42,428 INFO L87 Difference]: Start difference. First operand 207 states and 295 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:53:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:53:42,673 INFO L93 Difference]: Finished difference Result 489 states and 691 transitions. [2025-01-09 12:53:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:53:42,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 223 [2025-01-09 12:53:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:53:42,677 INFO L225 Difference]: With dead ends: 489 [2025-01-09 12:53:42,677 INFO L226 Difference]: Without dead ends: 348 [2025-01-09 12:53:42,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:53:42,679 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 172 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:53:42,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 950 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:53:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-01-09 12:53:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2025-01-09 12:53:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 238 states have (on average 1.23109243697479) internal successors, (293), 239 states have internal predecessors, (293), 99 states have call successors, (99), 8 states have call predecessors, (99), 8 states have return successors, (99), 98 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 12:53:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 491 transitions. [2025-01-09 12:53:42,730 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 491 transitions. Word has length 223 [2025-01-09 12:53:42,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:53:42,730 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 491 transitions. [2025-01-09 12:53:42,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:53:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 491 transitions. [2025-01-09 12:53:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-09 12:53:42,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:53:42,734 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:42,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 12:53:42,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:53:42,935 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:53:42,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:53:42,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1154208318, now seen corresponding path program 1 times [2025-01-09 12:53:42,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:53:42,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926800802] [2025-01-09 12:53:42,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:53:42,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:53:42,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 12:53:43,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 12:53:43,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:43,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:53:43,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [932841832] [2025-01-09 12:53:43,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:53:43,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:53:43,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:53:43,044 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 12:53:43,047 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 12:53:43,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 12:53:43,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 12:53:43,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:43,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:53:43,193 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:53:43,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 12:53:43,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 12:53:43,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:53:43,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:53:43,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:53:43,376 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:53:43,377 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:53:43,385 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 12:53:43,578 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,SelfDestructingSolverStorable8 [2025-01-09 12:53:43,581 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:53:43,687 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:53:43,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:53:43 BoogieIcfgContainer [2025-01-09 12:53:43,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:53:43,690 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:53:43,690 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:53:43,690 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:53:43,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:53:36" (3/4) ... [2025-01-09 12:53:43,692 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:53:43,693 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:53:43,694 INFO L158 Benchmark]: Toolchain (without parser) took 8585.27ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 112.3MB in the beginning and 170.7MB in the end (delta: -58.4MB). Peak memory consumption was 124.7MB. Max. memory is 16.1GB. [2025-01-09 12:53:43,694 INFO L158 Benchmark]: CDTParser took 0.25ms. 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 12:53:43,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.98ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 95.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:53:43,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.01ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 90.4MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:53:43,694 INFO L158 Benchmark]: Boogie Preprocessor took 76.05ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 84.8MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:53:43,695 INFO L158 Benchmark]: RCFGBuilder took 539.08ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 49.5MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 12:53:43,695 INFO L158 Benchmark]: TraceAbstraction took 7605.20ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 49.0MB in the beginning and 170.7MB in the end (delta: -121.7MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2025-01-09 12:53:43,695 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 327.2MB. Free memory was 170.7MB in the beginning and 170.7MB in the end (delta: 48.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:53:43,696 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.25ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.98ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 95.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.01ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 90.4MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.05ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 84.8MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 539.08ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 49.5MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7605.20ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 49.0MB in the beginning and 170.7MB in the end (delta: -121.7MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 327.2MB. Free memory was 170.7MB in the beginning and 170.7MB in the end (delta: 48.1kB). 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 shiftRight at line 91, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 190, overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of someBinaryFLOATComparisonOperation at line 149, overapproximation of someBinaryFLOATComparisonOperation at line 153, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 176, overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 190, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 1; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_8 = 0; [L26] signed short int var_1_9 = 256; [L27] signed short int var_1_10 = -25; [L28] unsigned char var_1_11 = 1; [L29] unsigned char var_1_12 = 0; [L30] float var_1_13 = 256.75; [L31] float var_1_15 = 256.25; [L32] float var_1_16 = 8.95; [L33] float var_1_17 = 256.375; [L34] float var_1_18 = 0.0; [L35] float var_1_19 = 3.75; [L36] unsigned short int var_1_20 = 64; [L37] unsigned short int var_1_21 = 0; [L38] float var_1_22 = 100.5; [L39] unsigned short int var_1_23 = 50; [L40] unsigned short int var_1_24 = 64; [L41] double var_1_25 = 32.6; [L42] unsigned char var_1_26 = 1; [L43] unsigned char var_1_28 = 0; [L44] double var_1_29 = 100.4; [L45] signed short int var_1_30 = 2; [L46] signed short int var_1_31 = 16; [L47] signed short int var_1_32 = 8; [L48] signed short int var_1_33 = 2; [L49] double var_1_34 = 0.0; [L50] double var_1_35 = 63.8; [L51] double var_1_36 = 127.75; [L52] double var_1_37 = 0.4; [L53] unsigned long int var_1_38 = 50; [L54] unsigned long int var_1_39 = 3554953517; [L55] unsigned char var_1_40 = 0; [L56] unsigned short int var_1_41 = 4; VAL [isInitial=0, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L194] isInitial = 1 [L195] FCALL initially() [L196] int k_loop; [L197] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L197] COND TRUE k_loop < 1 [L198] FCALL updateLastVariables() [L199] CALL updateVariables() [L132] var_1_4 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L133] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L134] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L134] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L135] var_1_8 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_9=256] [L136] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_9=256] [L137] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L137] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_10=-25, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L138] var_1_10 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_10 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L139] RET assume_abort_if_not(var_1_10 >= -32767) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L140] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L140] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=0, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L141] var_1_12 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L142] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L143] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L143] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=1025/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L144] var_1_15 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L145] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_16=179/20, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L146] var_1_16 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L147] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_17=2051/8, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L148] var_1_17 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L149] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_18=0, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L150] var_1_18 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L151] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_19=15/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L152] var_1_19 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L153] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L154] var_1_21 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L155] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L156] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L156] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=64, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L157] var_1_24 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L158] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L159] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L159] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=0, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L160] var_1_28 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L161] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L162] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L162] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=2, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L163] var_1_30 = __VERIFIER_nondet_short() [L164] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L164] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L165] CALL assume_abort_if_not(var_1_30 <= 16384) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L165] RET assume_abort_if_not(var_1_30 <= 16384) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=16, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L166] var_1_31 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L167] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L168] CALL assume_abort_if_not(var_1_31 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L168] RET assume_abort_if_not(var_1_31 <= 16383) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=8, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L169] var_1_32 = __VERIFIER_nondet_short() [L170] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L170] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L171] CALL assume_abort_if_not(var_1_32 <= 9) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L171] RET assume_abort_if_not(var_1_32 <= 9) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L172] var_1_33 = __VERIFIER_nondet_short() [L173] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L173] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L174] CALL assume_abort_if_not(var_1_33 <= 8) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L174] RET assume_abort_if_not(var_1_33 <= 8) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L175] var_1_34 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_34 >= 4611686.018427382800e+12F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L176] RET assume_abort_if_not((var_1_34 >= 4611686.018427382800e+12F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=319/5, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L177] var_1_35 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 2305843.009213691390e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L178] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 2305843.009213691390e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_36=511/4, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L179] var_1_36 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L180] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_37=2/5, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L181] var_1_37 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L182] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=3554953517, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L183] var_1_39 = __VERIFIER_nondet_ulong() [L184] CALL assume_abort_if_not(var_1_39 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L184] RET assume_abort_if_not(var_1_39 >= 3221225470) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L185] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L185] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_1=1, var_1_20=64, var_1_21=0, var_1_22=201/2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=256] [L199] RET updateVariables() [L200] CALL step() [L60] var_1_9 = ((((-10) < (var_1_10)) ? (-10) : (var_1_10))) [L61] var_1_11 = ((var_1_8 || var_1_4) && var_1_12) [L62] var_1_20 = (45013 - var_1_21) [L63] var_1_22 = ((((((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) > (var_1_17)) ? (((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) : (var_1_17))) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=50, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-10] [L64] COND TRUE (9999999.6 / var_1_18) > var_1_16 [L65] var_1_23 = ((((var_1_21 + var_1_24) < 0 ) ? -(var_1_21 + var_1_24) : (var_1_21 + var_1_24))) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=163/5, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=0, var_1_41=4, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-10] [L67] var_1_25 = (((((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) > (var_1_16)) ? ((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) : (var_1_16))) [L68] var_1_40 = var_1_28 [L69] var_1_41 = 10 VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-10] [L70] COND FALSE !(var_1_9 >= var_1_23) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-10] [L73] signed long int stepLocal_0 = var_1_20 - var_1_23; VAL [isInitial=1, stepLocal_0=45013, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=0, var_1_8=0, var_1_9=-10] [L74] COND TRUE var_1_20 <= stepLocal_0 [L75] var_1_5 = (var_1_1 || var_1_4) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L79] unsigned short int stepLocal_1 = var_1_23; VAL [isInitial=1, stepLocal_1=0, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L80] COND TRUE \read(var_1_1) VAL [isInitial=1, stepLocal_1=0, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L81] COND FALSE !(stepLocal_1 > var_1_23) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L87] unsigned short int stepLocal_5 = var_1_41; [L88] signed long int stepLocal_4 = (var_1_30 + var_1_31) - var_1_21; VAL [isInitial=1, stepLocal_4=0, stepLocal_5=10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L89] EXPR var_1_21 >> (var_1_32 + var_1_33) VAL [isInitial=1, stepLocal_4=0, stepLocal_5=10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L89] signed long int stepLocal_3 = var_1_21 >> (var_1_32 + var_1_33); [L90] COND TRUE \read(var_1_12) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_5=10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L91] EXPR var_1_9 >> var_1_41 VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_5=10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L91] COND FALSE !(stepLocal_5 <= (var_1_9 >> var_1_41)) [L101] signed short int stepLocal_9 = var_1_9; VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L102] EXPR var_1_31 & (var_1_20 * var_1_20) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L102] signed long int stepLocal_8 = var_1_31 & (var_1_20 * var_1_20); [L103] EXPR var_1_30 >> var_1_9 VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_8=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L103] signed long int stepLocal_7 = var_1_30 >> var_1_9; [L104] unsigned short int stepLocal_6 = var_1_20; VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L105] COND TRUE var_1_17 >= (- var_1_34) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=50, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L106] COND FALSE !(stepLocal_6 <= -1) [L111] var_1_38 = ((var_1_39 - (var_1_20 + 500u)) - 4u) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L126] signed long int stepLocal_2 = var_1_24 * var_1_23; VAL [isInitial=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L127] COND FALSE !(stepLocal_2 > (var_1_41 - var_1_38)) VAL [isInitial=1, stepLocal_3=0, stepLocal_4=0, stepLocal_7=0, stepLocal_8=0, stepLocal_9=-10, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L200] RET step() [L201] CALL, EXPR property() [L190] EXPR (((((((((((var_1_9 >= var_1_23) ? (var_1_1 == ((unsigned char) (! var_1_4))) : 1) && ((var_1_20 <= (var_1_20 - var_1_23)) ? (var_1_5 == ((unsigned char) (var_1_1 || var_1_4))) : (var_1_5 == ((unsigned char) (! (! var_1_8)))))) && (var_1_9 == ((signed short int) ((((-10) < (var_1_10)) ? (-10) : (var_1_10)))))) && (var_1_11 == ((unsigned char) ((var_1_8 || var_1_4) && var_1_12)))) && (var_1_1 ? ((var_1_23 > var_1_23) ? (var_1_13 == ((float) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1) : (var_1_13 == ((float) ((((var_1_17 - (var_1_18 - var_1_19)) < 0 ) ? -(var_1_17 - (var_1_18 - var_1_19)) : (var_1_17 - (var_1_18 - var_1_19)))))))) && (var_1_20 == ((unsigned short int) (45013 - var_1_21)))) && (var_1_22 == ((float) ((((((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) > (var_1_17)) ? (((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) : (var_1_17)))))) && (((9999999.6 / var_1_18) > var_1_16) ? (var_1_23 == ((unsigned short int) ((((var_1_21 + var_1_24) < 0 ) ? -(var_1_21 + var_1_24) : (var_1_21 + var_1_24))))) : 1)) && (var_1_25 == ((double) (((((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) > (var_1_16)) ? ((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) : (var_1_16)))))) && (((var_1_24 * var_1_23) > (var_1_41 - var_1_38)) ? (var_1_26 == ((unsigned char) (! ((var_1_4 && var_1_12) && var_1_28)))) : 1)) && (var_1_12 ? ((var_1_41 <= (var_1_9 >> var_1_41)) ? ((((var_1_30 + var_1_31) - var_1_21) >= 128) ? (((var_1_24 - var_1_41) <= (var_1_21 >> (var_1_32 + var_1_33))) ? (var_1_29 == ((double) (-0.4 + var_1_19))) : (var_1_29 == ((double) ((((((var_1_18) < (var_1_34)) ? (var_1_18) : (var_1_34))) - var_1_19) - ((var_1_35 + var_1_36) + var_1_37))))) : 1) : 1) : 1) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L190] EXPR ((((((((((((var_1_9 >= var_1_23) ? (var_1_1 == ((unsigned char) (! var_1_4))) : 1) && ((var_1_20 <= (var_1_20 - var_1_23)) ? (var_1_5 == ((unsigned char) (var_1_1 || var_1_4))) : (var_1_5 == ((unsigned char) (! (! var_1_8)))))) && (var_1_9 == ((signed short int) ((((-10) < (var_1_10)) ? (-10) : (var_1_10)))))) && (var_1_11 == ((unsigned char) ((var_1_8 || var_1_4) && var_1_12)))) && (var_1_1 ? ((var_1_23 > var_1_23) ? (var_1_13 == ((float) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1) : (var_1_13 == ((float) ((((var_1_17 - (var_1_18 - var_1_19)) < 0 ) ? -(var_1_17 - (var_1_18 - var_1_19)) : (var_1_17 - (var_1_18 - var_1_19)))))))) && (var_1_20 == ((unsigned short int) (45013 - var_1_21)))) && (var_1_22 == ((float) ((((((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) > (var_1_17)) ? (((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) : (var_1_17)))))) && (((9999999.6 / var_1_18) > var_1_16) ? (var_1_23 == ((unsigned short int) ((((var_1_21 + var_1_24) < 0 ) ? -(var_1_21 + var_1_24) : (var_1_21 + var_1_24))))) : 1)) && (var_1_25 == ((double) (((((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) > (var_1_16)) ? ((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) : (var_1_16)))))) && (((var_1_24 * var_1_23) > (var_1_41 - var_1_38)) ? (var_1_26 == ((unsigned char) (! ((var_1_4 && var_1_12) && var_1_28)))) : 1)) && (var_1_12 ? ((var_1_41 <= (var_1_9 >> var_1_41)) ? ((((var_1_30 + var_1_31) - var_1_21) >= 128) ? (((var_1_24 - var_1_41) <= (var_1_21 >> (var_1_32 + var_1_33))) ? (var_1_29 == ((double) (-0.4 + var_1_19))) : (var_1_29 == ((double) ((((((var_1_18) < (var_1_34)) ? (var_1_18) : (var_1_34))) - var_1_19) - ((var_1_35 + var_1_36) + var_1_37))))) : 1) : 1) : 1)) && ((var_1_17 >= (- var_1_34)) ? ((var_1_20 <= -1) ? (((~ var_1_30) > (var_1_31 & (var_1_20 * var_1_20))) ? (var_1_38 == ((unsigned long int) var_1_24)) : 1) : (var_1_38 == ((unsigned long int) ((var_1_39 - (var_1_20 + 500u)) - 4u)))) : ((var_1_9 <= (var_1_9 ^ var_1_32)) ? ((var_1_15 <= var_1_13) ? (((var_1_24 * var_1_9) <= (var_1_30 >> var_1_9)) ? (var_1_38 == ((unsigned long int) var_1_41)) : (var_1_38 == ((unsigned long int) var_1_39))) : (var_1_38 == ((unsigned long int) var_1_21))) : 1)) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L190-L191] return ((((((((((((((var_1_9 >= var_1_23) ? (var_1_1 == ((unsigned char) (! var_1_4))) : 1) && ((var_1_20 <= (var_1_20 - var_1_23)) ? (var_1_5 == ((unsigned char) (var_1_1 || var_1_4))) : (var_1_5 == ((unsigned char) (! (! var_1_8)))))) && (var_1_9 == ((signed short int) ((((-10) < (var_1_10)) ? (-10) : (var_1_10)))))) && (var_1_11 == ((unsigned char) ((var_1_8 || var_1_4) && var_1_12)))) && (var_1_1 ? ((var_1_23 > var_1_23) ? (var_1_13 == ((float) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1) : (var_1_13 == ((float) ((((var_1_17 - (var_1_18 - var_1_19)) < 0 ) ? -(var_1_17 - (var_1_18 - var_1_19)) : (var_1_17 - (var_1_18 - var_1_19)))))))) && (var_1_20 == ((unsigned short int) (45013 - var_1_21)))) && (var_1_22 == ((float) ((((((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) > (var_1_17)) ? (((((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) > (var_1_19)) ? (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16)))) : (var_1_19)))) : (var_1_17)))))) && (((9999999.6 / var_1_18) > var_1_16) ? (var_1_23 == ((unsigned short int) ((((var_1_21 + var_1_24) < 0 ) ? -(var_1_21 + var_1_24) : (var_1_21 + var_1_24))))) : 1)) && (var_1_25 == ((double) (((((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) > (var_1_16)) ? ((((((var_1_19) > (999.5)) ? (var_1_19) : (999.5))) - var_1_17)) : (var_1_16)))))) && (((var_1_24 * var_1_23) > (var_1_41 - var_1_38)) ? (var_1_26 == ((unsigned char) (! ((var_1_4 && var_1_12) && var_1_28)))) : 1)) && (var_1_12 ? ((var_1_41 <= (var_1_9 >> var_1_41)) ? ((((var_1_30 + var_1_31) - var_1_21) >= 128) ? (((var_1_24 - var_1_41) <= (var_1_21 >> (var_1_32 + var_1_33))) ? (var_1_29 == ((double) (-0.4 + var_1_19))) : (var_1_29 == ((double) ((((((var_1_18) < (var_1_34)) ? (var_1_18) : (var_1_34))) - var_1_19) - ((var_1_35 + var_1_36) + var_1_37))))) : 1) : 1) : 1)) && ((var_1_17 >= (- var_1_34)) ? ((var_1_20 <= -1) ? (((~ var_1_30) > (var_1_31 & (var_1_20 * var_1_20))) ? (var_1_38 == ((unsigned long int) var_1_24)) : 1) : (var_1_38 == ((unsigned long int) ((var_1_39 - (var_1_20 + 500u)) - 4u)))) : ((var_1_9 <= (var_1_9 ^ var_1_32)) ? ((var_1_15 <= var_1_13) ? (((var_1_24 * var_1_9) <= (var_1_30 >> var_1_9)) ? (var_1_38 == ((unsigned long int) var_1_41)) : (var_1_38 == ((unsigned long int) var_1_39))) : (var_1_38 == ((unsigned long int) var_1_21))) : 1))) && (var_1_40 == ((unsigned char) var_1_28))) && (var_1_41 == ((unsigned short int) 10)) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] [L19] reach_error() VAL [isInitial=1, var_1_10=-10, var_1_11=1, var_1_12=1, var_1_13=1027/4, var_1_15=2, var_1_16=0, var_1_17=0, var_1_19=0, var_1_1=1, var_1_20=45013, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=3, var_1_26=1, var_1_28=1, var_1_29=502/5, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_38=-4295012815, var_1_39=-4294967298, var_1_40=1, var_1_41=10, var_1_4=1, var_1_5=1, var_1_8=0, var_1_9=-10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 9, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1603 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1597 mSDsluCounter, 3304 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1496 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 992 IncrementalHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 1808 mSDtfsCounter, 992 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 925 GetRequests, 895 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=8, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 149 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2872 NumberOfCodeBlocks, 2872 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2412 ConstructedInterpolants, 0 QuantifiedInterpolants, 4995 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1501 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 22934/23232 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 12:53:43,716 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-44.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 adb5fb4d805ca2a5692f9b69f128d488862bca1b1bd46cb53a0587439b8a768f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:53:45,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:53:45,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:53:45,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:53:45,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:53:45,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:53:45,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:53:45,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:53:45,811 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:53:45,812 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:53:45,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:53:45,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:53:45,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:53:45,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:53:45,813 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:53:45,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:53:45,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:53:45,814 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:53:45,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:53:45,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:53:45,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:53:45,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:53:45,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:53:45,814 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:53:45,814 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:53:45,814 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:53:45,814 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:53:45,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:53:45,814 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:53:45,815 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:53:45,815 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:53:45,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:53:45,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:53:45,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:53:45,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:53:45,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:53:45,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:53:45,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:53:45,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:53:45,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:53:45,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:53:45,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:53:45,816 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:53:45,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:53:45,816 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:53:45,816 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:53:45,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:53:45,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:53:45,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:53:45,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:53:45,816 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 -> adb5fb4d805ca2a5692f9b69f128d488862bca1b1bd46cb53a0587439b8a768f [2025-01-09 12:53:46,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:53:46,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:53:46,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:53:46,120 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:53:46,120 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:53:46,121 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-44.i [2025-01-09 12:53:47,284 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd9f619bb/1a165cfffdfc48e1950c3361af3c97b3/FLAGd6729f00e [2025-01-09 12:53:47,527 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:53:47,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-44.i [2025-01-09 12:53:47,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd9f619bb/1a165cfffdfc48e1950c3361af3c97b3/FLAGd6729f00e [2025-01-09 12:53:47,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd9f619bb/1a165cfffdfc48e1950c3361af3c97b3 [2025-01-09 12:53:47,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:53:47,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:53:47,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:53:47,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:53:47,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:53:47,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:53:47" (1/1) ... [2025-01-09 12:53:47,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c464ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:47, skipping insertion in model container [2025-01-09 12:53:47,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:53:47" (1/1) ... [2025-01-09 12:53:47,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:53:47,978 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-44.i[916,929] [2025-01-09 12:53:48,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:53:48,075 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:53:48,084 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-44.i[916,929] [2025-01-09 12:53:48,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:53:48,141 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:53:48,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48 WrapperNode [2025-01-09 12:53:48,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:53:48,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:53:48,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:53:48,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:53:48,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48" (1/1) ... [2025-01-09 12:53:48,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48" (1/1) ... [2025-01-09 12:53:48,196 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 214 [2025-01-09 12:53:48,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:53:48,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:53:48,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:53:48,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:53:48,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48" (1/1) ... [2025-01-09 12:53:48,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48" (1/1) ... [2025-01-09 12:53:48,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48" (1/1) ... [2025-01-09 12:53:48,228 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 12:53:48,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48" (1/1) ... [2025-01-09 12:53:48,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48" (1/1) ... [2025-01-09 12:53:48,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48" (1/1) ... [2025-01-09 12:53:48,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48" (1/1) ... [2025-01-09 12:53:48,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48" (1/1) ... [2025-01-09 12:53:48,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48" (1/1) ... [2025-01-09 12:53:48,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48" (1/1) ... [2025-01-09 12:53:48,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:53:48,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:53:48,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:53:48,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:53:48,260 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48" (1/1) ... [2025-01-09 12:53:48,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:53:48,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:53:48,289 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 12:53:48,295 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 12:53:48,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:53:48,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:53:48,314 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:53:48,314 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:53:48,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:53:48,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:53:48,393 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:53:48,395 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:54:08,402 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-01-09 12:54:08,402 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:54:08,410 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:54:08,410 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:54:08,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:54:08 BoogieIcfgContainer [2025-01-09 12:54:08,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:54:08,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:54:08,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:54:08,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:54:08,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:53:47" (1/3) ... [2025-01-09 12:54:08,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307892b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:54:08, skipping insertion in model container [2025-01-09 12:54:08,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:48" (2/3) ... [2025-01-09 12:54:08,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307892b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:54:08, skipping insertion in model container [2025-01-09 12:54:08,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:54:08" (3/3) ... [2025-01-09 12:54:08,418 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-44.i [2025-01-09 12:54:08,430 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:54:08,431 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-44.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:54:08,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:54:08,499 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;@71b01d67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:54:08,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:54:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 59 states have internal predecessors, (78), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:54:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 12:54:08,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:54:08,514 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:08,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:54:08,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:54:08,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1951003325, now seen corresponding path program 1 times [2025-01-09 12:54:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:54:08,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859719346] [2025-01-09 12:54:08,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:54:08,530 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 12:54:08,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:54:08,535 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 12:54:08,536 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 12:54:08,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 12:54:09,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 12:54:09,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:54:09,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:54:09,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:54:09,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:54:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2025-01-09 12:54:09,692 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:54:09,693 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:54:09,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859719346] [2025-01-09 12:54:09,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859719346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:54:09,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:54:09,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:54:09,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279007740] [2025-01-09 12:54:09,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:54:09,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:54:09,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:54:09,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:54:09,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:54:09,715 INFO L87 Difference]: Start difference. First operand has 94 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 59 states have internal predecessors, (78), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 12:54:09,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:54:09,740 INFO L93 Difference]: Finished difference Result 184 states and 316 transitions. [2025-01-09 12:54:09,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:54:09,742 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 209 [2025-01-09 12:54:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:54:09,746 INFO L225 Difference]: With dead ends: 184 [2025-01-09 12:54:09,746 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 12:54:09,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 208 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 12:54:09,749 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 12:54:09,750 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 12:54:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 12:54:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-09 12:54:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:54:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 136 transitions. [2025-01-09 12:54:09,779 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 136 transitions. Word has length 209 [2025-01-09 12:54:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:54:09,780 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 136 transitions. [2025-01-09 12:54:09,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 12:54:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2025-01-09 12:54:09,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 12:54:09,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:54:09,782 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:09,810 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 12:54:09,987 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 12:54:09,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:54:09,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:54:09,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1087568257, now seen corresponding path program 1 times [2025-01-09 12:54:09,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:54:09,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145619417] [2025-01-09 12:54:09,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:54:09,988 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 12:54:09,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:54:09,992 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 12:54:09,993 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 12:54:10,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 12:54:11,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 12:54:11,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:54:11,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:54:11,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 12:54:11,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:54:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:54:11,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:54:11,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:54:11,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145619417] [2025-01-09 12:54:11,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145619417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:54:11,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:54:11,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:54:11,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951994397] [2025-01-09 12:54:11,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:54:11,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:54:11,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:54:11,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:54:11,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:54:11,761 INFO L87 Difference]: Start difference. First operand 90 states and 136 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:54:16,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 12:54:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:54:16,252 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2025-01-09 12:54:16,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:54:16,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-01-09 12:54:16,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:54:16,393 INFO L225 Difference]: With dead ends: 235 [2025-01-09 12:54:16,393 INFO L226 Difference]: Without dead ends: 148 [2025-01-09 12:54:16,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:54:16,394 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 124 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:54:16,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 307 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 12:54:16,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-09 12:54:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 88. [2025-01-09 12:54:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:54:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2025-01-09 12:54:16,410 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 209 [2025-01-09 12:54:16,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:54:16,411 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2025-01-09 12:54:16,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:54:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2025-01-09 12:54:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 12:54:16,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:54:16,413 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:16,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 12:54:16,614 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 12:54:16,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:54:16,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:54:16,618 INFO L85 PathProgramCache]: Analyzing trace with hash 66499903, now seen corresponding path program 1 times [2025-01-09 12:54:16,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:54:16,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122442258] [2025-01-09 12:54:16,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:54:16,619 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 12:54:16,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:54:16,620 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 12:54:16,622 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 12:54:16,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 12:54:17,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 12:54:17,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:54:17,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:54:17,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 12:54:17,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:54:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:54:24,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:54:24,243 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:54:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122442258] [2025-01-09 12:54:24,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122442258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:54:24,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:54:24,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:54:24,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369680513] [2025-01-09 12:54:24,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:54:24,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:54:24,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:54:24,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:54:24,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:54:24,250 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:54:28,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:54:28,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:54:28,608 INFO L93 Difference]: Finished difference Result 173 states and 257 transitions. [2025-01-09 12:54:28,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:54:28,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-01-09 12:54:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:54:28,749 INFO L225 Difference]: With dead ends: 173 [2025-01-09 12:54:28,749 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 12:54:28,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:54:28,751 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:54:28,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 12:54:28,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 12:54:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 12:54:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:54:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 129 transitions. [2025-01-09 12:54:28,759 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 129 transitions. Word has length 209 [2025-01-09 12:54:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:54:28,760 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 129 transitions. [2025-01-09 12:54:28,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:54:28,760 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 129 transitions. [2025-01-09 12:54:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 12:54:28,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:54:28,765 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:28,797 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 12:54:28,969 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 12:54:28,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:54:28,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:54:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1512676247, now seen corresponding path program 1 times [2025-01-09 12:54:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:54:28,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139251422] [2025-01-09 12:54:28,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:54:28,974 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 12:54:28,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:54:28,976 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 12:54:28,977 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 12:54:29,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 12:54:30,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 12:54:30,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:54:30,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:54:30,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 12:54:30,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:54:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 12:54:30,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:54:30,204 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:54:30,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139251422] [2025-01-09 12:54:30,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139251422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:54:30,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:54:30,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:54:30,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038486167] [2025-01-09 12:54:30,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:54:30,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:54:30,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:54:30,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:54:30,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:54:30,206 INFO L87 Difference]: Start difference. First operand 88 states and 129 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:54:34,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:54:38,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:54:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:54:38,960 INFO L93 Difference]: Finished difference Result 173 states and 255 transitions. [2025-01-09 12:54:39,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:54:39,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2025-01-09 12:54:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:54:39,098 INFO L225 Difference]: With dead ends: 173 [2025-01-09 12:54:39,098 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 12:54:39,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:54:39,099 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:54:39,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2025-01-09 12:54:39,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 12:54:39,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 12:54:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:54:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2025-01-09 12:54:39,107 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 210 [2025-01-09 12:54:39,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:54:39,109 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2025-01-09 12:54:39,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 12:54:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2025-01-09 12:54:39,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 12:54:39,112 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:54:39,112 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:39,146 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 (5)] Forceful destruction successful, exit code 0 [2025-01-09 12:54:39,317 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 12:54:39,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:54:39,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:54:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1770841685, now seen corresponding path program 1 times [2025-01-09 12:54:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:54:39,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573784809] [2025-01-09 12:54:39,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:54:39,319 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 12:54:39,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:54:39,321 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 12:54:39,323 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 12:54:39,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 12:54:40,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 12:54:40,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:54:40,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:54:40,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 12:54:40,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:54:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 668 proven. 78 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2025-01-09 12:54:45,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:54:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 18 proven. 78 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-01-09 12:54:50,202 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:54:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573784809] [2025-01-09 12:54:50,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573784809] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:54:50,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:54:50,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 12:54:50,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926867663] [2025-01-09 12:54:50,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:54:50,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:54:50,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:54:50,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:54:50,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:54:50,207 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 12:54:58,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:55:02,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:55:06,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:55:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:55:07,077 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2025-01-09 12:55:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:55:07,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 210 [2025-01-09 12:55:07,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:55:07,082 INFO L225 Difference]: With dead ends: 192 [2025-01-09 12:55:07,082 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 12:55:07,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 412 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:55:07,084 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 34 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:55:07,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 233 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 3 Unknown, 0 Unchecked, 16.3s Time] [2025-01-09 12:55:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 12:55:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2025-01-09 12:55:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 61 states have internal predecessors, (68), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 12:55:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2025-01-09 12:55:07,116 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 210 [2025-01-09 12:55:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:55:07,116 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2025-01-09 12:55:07,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 12:55:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2025-01-09 12:55:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 12:55:07,117 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:07,117 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:07,150 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 (6)] Forceful destruction successful, exit code 0 [2025-01-09 12:55:07,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 12:55:07,318 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:07,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:07,322 INFO L85 PathProgramCache]: Analyzing trace with hash 857672648, now seen corresponding path program 1 times [2025-01-09 12:55:07,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:55:07,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664478784] [2025-01-09 12:55:07,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:07,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:55:07,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:55:07,325 INFO L229 MonitoredProcess]: Starting monitored process 7 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 12:55:07,327 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 (7)] Waiting until timeout for monitored process [2025-01-09 12:55:07,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 12:55:08,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 12:55:08,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:08,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:08,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 12:55:08,413 INFO L279 TraceCheckSpWp]: Computing forward predicates...