./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-36.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_codestructure_steplocals_file-36.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 aae97478c9cf89d3b2713a25e47de00318f43601d24471aead34c742a446c244 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:53:15,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:53:15,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 08:53:15,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:53:15,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:53:15,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:53:15,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:53:15,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:53:15,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:53:15,382 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:53:15,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:53:15,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:53:15,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:53:15,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:53:15,383 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:53:15,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:53:15,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:53:15,384 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:53:15,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:53:15,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:53:15,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:53:15,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:53:15,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:53:15,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:53:15,385 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:53:15,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:53:15,385 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:53:15,385 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:53:15,385 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:53:15,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:53:15,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:53:15,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:53:15,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:53:15,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:53:15,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:53:15,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:53:15,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:53:15,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:53:15,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:53:15,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:53:15,386 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:53:15,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:53:15,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:53:15,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:53:15,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:53:15,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:53:15,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:53:15,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:53:15,387 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 -> aae97478c9cf89d3b2713a25e47de00318f43601d24471aead34c742a446c244 [2025-01-09 08:53:15,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:53:15,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:53:15,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:53:15,642 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:53:15,642 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:53:15,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-36.i [2025-01-09 08:53:16,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83921f8f8/1935683c506f4390890a720469c4b347/FLAG7fd3427bd [2025-01-09 08:53:17,062 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:53:17,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-36.i [2025-01-09 08:53:17,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83921f8f8/1935683c506f4390890a720469c4b347/FLAG7fd3427bd [2025-01-09 08:53:17,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83921f8f8/1935683c506f4390890a720469c4b347 [2025-01-09 08:53:17,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:53:17,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:53:17,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:53:17,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:53:17,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:53:17,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4366b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17, skipping insertion in model container [2025-01-09 08:53:17,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:53:17,222 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_codestructure_steplocals_file-36.i[917,930] [2025-01-09 08:53:17,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:53:17,286 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:53:17,295 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_codestructure_steplocals_file-36.i[917,930] [2025-01-09 08:53:17,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:53:17,335 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:53:17,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17 WrapperNode [2025-01-09 08:53:17,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:53:17,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:53:17,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:53:17,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:53:17,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,381 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2025-01-09 08:53:17,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:53:17,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:53:17,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:53:17,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:53:17,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,408 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 08:53:17,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,419 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:53:17,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:53:17,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:53:17,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:53:17,432 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17" (1/1) ... [2025-01-09 08:53:17,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:53:17,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:53:17,456 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 08:53:17,460 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 08:53:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:53:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:53:17,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:53:17,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:53:17,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:53:17,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:53:17,540 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:53:17,542 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:53:17,765 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 08:53:17,765 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:53:17,772 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:53:17,775 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:53:17,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:53:17 BoogieIcfgContainer [2025-01-09 08:53:17,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:53:17,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:53:17,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:53:17,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:53:17,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:53:17" (1/3) ... [2025-01-09 08:53:17,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223ab0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:53:17, skipping insertion in model container [2025-01-09 08:53:17,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:17" (2/3) ... [2025-01-09 08:53:17,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223ab0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:53:17, skipping insertion in model container [2025-01-09 08:53:17,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:53:17" (3/3) ... [2025-01-09 08:53:17,783 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-36.i [2025-01-09 08:53:17,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:53:17,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-36.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:53:17,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:53:17,845 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;@66a512, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:53:17,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:53:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 08:53:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 08:53:17,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:53:17,860 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:53:17,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:53:17,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:53:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1118806925, now seen corresponding path program 1 times [2025-01-09 08:53:17,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:53:17,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213141392] [2025-01-09 08:53:17,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:53:17,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:53:17,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 08:53:17,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 08:53:17,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:53:17,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:53:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 08:53:18,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:53:18,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213141392] [2025-01-09 08:53:18,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213141392] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:53:18,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250176371] [2025-01-09 08:53:18,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:53:18,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:53:18,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:53:18,130 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 08:53:18,132 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 08:53:18,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 08:53:18,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 08:53:18,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:53:18,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:53:18,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:53:18,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:53:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 08:53:18,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:53:18,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250176371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:53:18,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:53:18,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:53:18,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162578347] [2025-01-09 08:53:18,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:53:18,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:53:18,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:53:18,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:53:18,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:53:18,336 INFO L87 Difference]: Start difference. First operand has 75 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 08:53:18,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:53:18,352 INFO L93 Difference]: Finished difference Result 144 states and 249 transitions. [2025-01-09 08:53:18,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:53:18,353 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2025-01-09 08:53:18,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:53:18,357 INFO L225 Difference]: With dead ends: 144 [2025-01-09 08:53:18,357 INFO L226 Difference]: Without dead ends: 72 [2025-01-09 08:53:18,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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 08:53:18,361 INFO L435 NwaCegarLoop]: 109 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, 109 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 08:53:18,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:53:18,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-09 08:53:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-01-09 08:53:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 08:53:18,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2025-01-09 08:53:18,390 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 165 [2025-01-09 08:53:18,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:53:18,390 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2025-01-09 08:53:18,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 08:53:18,390 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2025-01-09 08:53:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 08:53:18,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:53:18,393 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:53:18,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 08:53:18,598 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 08:53:18,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:53:18,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:53:18,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1368037163, now seen corresponding path program 1 times [2025-01-09 08:53:18,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:53:18,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042274354] [2025-01-09 08:53:18,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:53:18,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:53:18,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 08:53:18,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 08:53:18,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:53:18,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:53:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 08:53:18,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:53:18,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042274354] [2025-01-09 08:53:18,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042274354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:53:18,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:53:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:53:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920229731] [2025-01-09 08:53:18,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:53:18,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:53:18,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:53:18,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:53:18,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:53:18,763 INFO L87 Difference]: Start difference. First operand 72 states and 109 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 08:53:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:53:18,802 INFO L93 Difference]: Finished difference Result 162 states and 246 transitions. [2025-01-09 08:53:18,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:53:18,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2025-01-09 08:53:18,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:53:18,805 INFO L225 Difference]: With dead ends: 162 [2025-01-09 08:53:18,806 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 08:53:18,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:53:18,808 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 29 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:53:18,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 195 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:53:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 08:53:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2025-01-09 08:53:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 08:53:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 128 transitions. [2025-01-09 08:53:18,823 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 128 transitions. Word has length 165 [2025-01-09 08:53:18,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:53:18,824 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 128 transitions. [2025-01-09 08:53:18,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 08:53:18,824 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 128 transitions. [2025-01-09 08:53:18,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 08:53:18,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:53:18,826 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:53:18,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:53:18,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:53:18,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:53:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1626202601, now seen corresponding path program 1 times [2025-01-09 08:53:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:53:18,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580509314] [2025-01-09 08:53:18,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:53:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:53:18,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 08:53:18,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 08:53:18,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:53:18,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 08:53:18,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [489161553] [2025-01-09 08:53:18,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:53:18,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:53:18,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:53:18,943 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 08:53:18,944 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 08:53:19,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 08:53:19,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 08:53:19,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:53:19,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:53:19,075 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:53:19,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 08:53:19,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 08:53:19,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:53:19,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:53:19,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:53:19,183 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:53:19,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:53:19,196 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 08:53:19,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:53:19,388 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 08:53:19,466 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:53:19,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:53:19 BoogieIcfgContainer [2025-01-09 08:53:19,471 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:53:19,472 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:53:19,472 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:53:19,472 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:53:19,472 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:53:17" (3/4) ... [2025-01-09 08:53:19,474 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:53:19,475 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:53:19,476 INFO L158 Benchmark]: Toolchain (without parser) took 2383.11ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 79.5MB in the end (delta: 33.1MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2025-01-09 08:53:19,476 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:53:19,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.04ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 97.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:53:19,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.19ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:53:19,478 INFO L158 Benchmark]: Boogie Preprocessor took 49.08ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 90.8MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:53:19,478 INFO L158 Benchmark]: RCFGBuilder took 344.13ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 70.3MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 08:53:19,479 INFO L158 Benchmark]: TraceAbstraction took 1694.44ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 80.5MB in the end (delta: -10.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:53:19,479 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 79.5MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:53:19,480 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.28ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.04ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 97.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.19ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.08ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 90.8MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 344.13ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 70.3MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1694.44ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 80.5MB in the end (delta: -10.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 79.5MB in the end (delta: 24.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 someBinaryArithmeticDOUBLEoperation at line 51, overapproximation of someBinaryArithmeticDOUBLEoperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 65. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.75; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 9.6; [L25] double var_1_4 = 7.625; [L26] double var_1_5 = 1.5; [L27] double var_1_6 = 63.17; [L28] double var_1_7 = 15.5; [L29] unsigned short int var_1_8 = 4; [L30] unsigned short int var_1_9 = 45624; [L31] unsigned short int var_1_10 = 39447; [L32] unsigned short int var_1_11 = 10; [L33] double var_1_12 = 255.5; [L34] double var_1_13 = 0.0; [L35] double var_1_14 = 127.5; [L36] float var_1_15 = 8.2; [L37] float var_1_16 = 2.8; [L38] signed short int var_1_17 = 8; [L39] double var_1_18 = 24.8; [L40] signed short int var_1_19 = -256; [L41] signed short int var_1_20 = 8; [L42] signed short int var_1_21 = 16; [L43] unsigned short int var_1_22 = 2; [L44] signed long int var_1_23 = -100; [L45] unsigned short int var_1_24 = 16; [L46] unsigned char var_1_25 = 0; VAL [isInitial=0, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L140] isInitial = 1 [L141] FCALL initially() [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L91] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L92] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L92] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L93] var_1_3 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L94] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L95] var_1_4 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L96] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L97] var_1_5 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L98] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L99] var_1_6 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L100] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L101] var_1_7 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=45624] [L102] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=45624] [L103] var_1_9 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_9 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L104] RET assume_abort_if_not(var_1_9 >= 32767) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L105] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L105] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L106] var_1_10 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L107] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, var_1_10=32770, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L108] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L108] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=32770, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L109] var_1_11 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L110] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32770, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L111] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L111] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L112] var_1_13 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L113] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L114] var_1_18 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L115] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L116] CALL assume_abort_if_not(var_1_18 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L116] RET assume_abort_if_not(var_1_18 != 0.0F) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L117] var_1_19 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_19 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L118] RET assume_abort_if_not(var_1_19 >= -32767) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L119] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L119] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L120] var_1_20 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_20 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L121] RET assume_abort_if_not(var_1_20 >= -1) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L122] CALL assume_abort_if_not(var_1_20 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L122] RET assume_abort_if_not(var_1_20 <= 32766) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L123] var_1_21 = __VERIFIER_nondet_short() [L124] CALL assume_abort_if_not(var_1_21 >= -32766) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L124] RET assume_abort_if_not(var_1_21 >= -32766) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L125] CALL assume_abort_if_not(var_1_21 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L125] RET assume_abort_if_not(var_1_21 <= 32766) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L126] var_1_23 = __VERIFIER_nondet_long() [L127] CALL assume_abort_if_not(var_1_23 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L127] RET assume_abort_if_not(var_1_23 >= -2147483648) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L128] CALL assume_abort_if_not(var_1_23 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L128] RET assume_abort_if_not(var_1_23 <= 2147483647) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=0, var_1_2=1, var_1_8=4, var_1_9=32768] [L129] var_1_25 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_2=1, var_1_8=4, var_1_9=32768] [L130] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_2=1, var_1_8=4, var_1_9=32768] [L131] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_8=4, var_1_9=32768] [L131] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_8=4, var_1_9=32768] [L144] RET updateVariables() [L145] CALL step() [L50] COND TRUE \read(var_1_2) [L51] var_1_1 = (((((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) < (var_1_7)) ? ((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) : (var_1_7))) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=4, var_1_9=32768] [L53] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32768, var_1_9=32768] [L54] COND TRUE \read(var_1_2) [L55] var_1_12 = (((((var_1_3 - (var_1_13 - 128.68))) < (var_1_7)) ? ((var_1_3 - (var_1_13 - 128.68))) : (var_1_7))) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=3, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32768, var_1_9=32768] [L57] var_1_14 = var_1_6 VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32768, var_1_9=32768] [L58] COND FALSE !(var_1_13 >= var_1_14) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32768, var_1_9=32768] [L65] COND TRUE var_1_3 <= var_1_4 [L66] var_1_16 = ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32768, var_1_9=32768] [L68] unsigned short int stepLocal_0 = var_1_11; VAL [isInitial=1, stepLocal_0=0, var_1_10=32770, var_1_11=0, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32768, var_1_9=32768] [L69] COND FALSE !(var_1_7 >= (var_1_5 / ((((var_1_13) < (var_1_18)) ? (var_1_13) : (var_1_18))))) [L78] var_1_17 = var_1_21 VAL [isInitial=1, stepLocal_0=0, var_1_10=32770, var_1_11=0, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=-1, var_1_21=1, var_1_22=2, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32768, var_1_9=32768] [L80] COND TRUE (var_1_11 + var_1_20) <= ((var_1_21 * var_1_23) * var_1_19) [L81] var_1_22 = (((((var_1_9 - var_1_11)) > (var_1_10)) ? ((var_1_9 - var_1_11)) : (var_1_10))) VAL [isInitial=1, stepLocal_0=0, var_1_10=32770, var_1_11=0, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=-1, var_1_21=1, var_1_22=32770, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32768, var_1_9=32768] [L83] COND FALSE !(var_1_9 < var_1_11) VAL [isInitial=1, stepLocal_0=0, var_1_10=32770, var_1_11=0, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=-1, var_1_21=1, var_1_22=32770, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32768, var_1_9=32768] [L145] RET step() [L146] CALL, EXPR property() [L136-L137] return ((((((((var_1_2 ? (var_1_1 == ((double) (((((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) < (var_1_7)) ? ((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) : (var_1_7))))) : 1) && (var_1_8 == ((unsigned short int) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11)))) && (var_1_2 ? (var_1_12 == ((double) (((((var_1_3 - (var_1_13 - 128.68))) < (var_1_7)) ? ((var_1_3 - (var_1_13 - 128.68))) : (var_1_7))))) : 1)) && (var_1_14 == ((double) var_1_6))) && ((var_1_13 >= var_1_14) ? (var_1_2 ? ((var_1_8 == var_1_11) ? (var_1_15 == ((float) 10.975f)) : 1) : 1) : 1)) && ((var_1_3 <= var_1_4) ? (var_1_16 == ((float) ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))) : 1)) && ((var_1_7 >= (var_1_5 / ((((var_1_13) < (var_1_18)) ? (var_1_13) : (var_1_18))))) ? (((var_1_10 + var_1_9) <= var_1_11) ? (var_1_2 ? (var_1_17 == ((signed short int) var_1_19)) : 1) : (var_1_17 == ((signed short int) (var_1_20 - ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))))) : (var_1_17 == ((signed short int) var_1_21)))) && (((var_1_11 + var_1_20) <= ((var_1_21 * var_1_23) * var_1_19)) ? (var_1_22 == ((unsigned short int) (((((var_1_9 - var_1_11)) > (var_1_10)) ? ((var_1_9 - var_1_11)) : (var_1_10))))) : 1)) && ((var_1_9 < var_1_11) ? ((var_1_2 || var_1_25) ? (var_1_24 == ((unsigned short int) 128)) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=-1, var_1_21=1, var_1_22=32770, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32768, var_1_9=32768] [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=-1, var_1_21=1, var_1_22=32770, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32768, var_1_9=32768] [L19] reach_error() VAL [isInitial=1, var_1_10=32770, var_1_11=0, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=-1, var_1_21=1, var_1_22=32770, var_1_23=-1, var_1_24=16, var_1_25=1, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32768, var_1_9=32768] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 304 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 213 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 825 NumberOfCodeBlocks, 825 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 492 ConstructedInterpolants, 0 QuantifiedInterpolants, 502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 367 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3850/3900 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 08:53:19,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-36.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 aae97478c9cf89d3b2713a25e47de00318f43601d24471aead34c742a446c244 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:53:21,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:53:21,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 08:53:21,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:53:21,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:53:21,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:53:21,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:53:21,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:53:21,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:53:21,398 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:53:21,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:53:21,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:53:21,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:53:21,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:53:21,399 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:53:21,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:53:21,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:53:21,399 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:53:21,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:53:21,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:53:21,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:53:21,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:53:21,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:53:21,399 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:53:21,399 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:53:21,399 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:53:21,400 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:53:21,400 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:53:21,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:53:21,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:53:21,401 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:53:21,401 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:53:21,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:53:21,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:53:21,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:53:21,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:53:21,401 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 -> aae97478c9cf89d3b2713a25e47de00318f43601d24471aead34c742a446c244 [2025-01-09 08:53:21,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:53:21,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:53:21,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:53:21,643 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:53:21,645 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:53:21,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-36.i [2025-01-09 08:53:22,780 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc404ee53/3aa05a3486f0474bb08a166536021dab/FLAGdc707b46f [2025-01-09 08:53:22,987 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:53:22,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-36.i [2025-01-09 08:53:22,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc404ee53/3aa05a3486f0474bb08a166536021dab/FLAGdc707b46f [2025-01-09 08:53:23,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc404ee53/3aa05a3486f0474bb08a166536021dab [2025-01-09 08:53:23,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:53:23,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:53:23,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:53:23,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:53:23,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:53:23,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ed8872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23, skipping insertion in model container [2025-01-09 08:53:23,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:53:23,130 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_codestructure_steplocals_file-36.i[917,930] [2025-01-09 08:53:23,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:53:23,197 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:53:23,206 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_codestructure_steplocals_file-36.i[917,930] [2025-01-09 08:53:23,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:53:23,249 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:53:23,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23 WrapperNode [2025-01-09 08:53:23,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:53:23,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:53:23,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:53:23,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:53:23,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,292 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2025-01-09 08:53:23,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:53:23,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:53:23,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:53:23,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:53:23,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,326 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 08:53:23,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,339 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:53:23,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:53:23,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:53:23,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:53:23,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23" (1/1) ... [2025-01-09 08:53:23,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:53:23,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:53:23,384 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 08:53:23,389 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 08:53:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:53:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:53:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:53:23,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:53:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:53:23,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:53:23,460 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:53:23,461 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:53:34,070 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 08:53:34,070 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:53:34,086 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:53:34,086 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:53:34,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:53:34 BoogieIcfgContainer [2025-01-09 08:53:34,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:53:34,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:53:34,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:53:34,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:53:34,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:53:23" (1/3) ... [2025-01-09 08:53:34,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16038585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:53:34, skipping insertion in model container [2025-01-09 08:53:34,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:23" (2/3) ... [2025-01-09 08:53:34,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16038585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:53:34, skipping insertion in model container [2025-01-09 08:53:34,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:53:34" (3/3) ... [2025-01-09 08:53:34,092 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-36.i [2025-01-09 08:53:34,101 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:53:34,102 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-36.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:53:34,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:53:34,147 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;@42c8d99e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:53:34,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:53:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 08:53:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 08:53:34,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:53:34,158 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:53:34,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:53:34,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:53:34,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1118806925, now seen corresponding path program 1 times [2025-01-09 08:53:34,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:53:34,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200097110] [2025-01-09 08:53:34,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:53:34,168 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 08:53:34,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:53:34,171 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 08:53:34,172 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 08:53:34,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 08:53:35,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 08:53:35,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:53:35,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:53:35,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:53:35,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:53:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-01-09 08:53:35,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:53:35,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:53:35,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200097110] [2025-01-09 08:53:35,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200097110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:53:35,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:53:35,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 08:53:35,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978839214] [2025-01-09 08:53:35,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:53:35,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:53:35,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:53:35,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:53:35,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:53:35,126 INFO L87 Difference]: Start difference. First operand has 75 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 08:53:35,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:53:35,144 INFO L93 Difference]: Finished difference Result 144 states and 249 transitions. [2025-01-09 08:53:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:53:35,145 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2025-01-09 08:53:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:53:35,149 INFO L225 Difference]: With dead ends: 144 [2025-01-09 08:53:35,149 INFO L226 Difference]: Without dead ends: 72 [2025-01-09 08:53:35,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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 08:53:35,152 INFO L435 NwaCegarLoop]: 109 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, 109 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 08:53:35,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:53:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-09 08:53:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-01-09 08:53:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 08:53:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2025-01-09 08:53:35,186 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 165 [2025-01-09 08:53:35,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:53:35,186 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2025-01-09 08:53:35,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 08:53:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2025-01-09 08:53:35,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 08:53:35,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:53:35,189 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:53:35,213 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 08:53:35,389 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 08:53:35,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:53:35,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:53:35,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1368037163, now seen corresponding path program 1 times [2025-01-09 08:53:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:53:35,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139790664] [2025-01-09 08:53:35,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:53:35,391 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 08:53:35,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:53:35,392 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 08:53:35,393 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 08:53:35,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 08:53:36,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 08:53:36,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:53:36,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:53:36,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 08:53:36,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:53:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 08:53:36,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:53:36,412 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:53:36,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139790664] [2025-01-09 08:53:36,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139790664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:53:36,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:53:36,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:53:36,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216082487] [2025-01-09 08:53:36,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:53:36,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:53:36,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:53:36,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:53:36,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:53:36,415 INFO L87 Difference]: Start difference. First operand 72 states and 109 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 08:53:37,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:53:41,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:53:46,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:53:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:53:46,287 INFO L93 Difference]: Finished difference Result 162 states and 246 transitions. [2025-01-09 08:53:46,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:53:46,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2025-01-09 08:53:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:53:46,371 INFO L225 Difference]: With dead ends: 162 [2025-01-09 08:53:46,371 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 08:53:46,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 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 08:53:46,372 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 29 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2025-01-09 08:53:46,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 195 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 13 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time] [2025-01-09 08:53:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 08:53:46,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2025-01-09 08:53:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 08:53:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 128 transitions. [2025-01-09 08:53:46,384 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 128 transitions. Word has length 165 [2025-01-09 08:53:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:53:46,386 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 128 transitions. [2025-01-09 08:53:46,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 08:53:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 128 transitions. [2025-01-09 08:53:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 08:53:46,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:53:46,388 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:53:46,414 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 08:53:46,588 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 08:53:46,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:53:46,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:53:46,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1626202601, now seen corresponding path program 1 times [2025-01-09 08:53:46,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:53:46,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987096109] [2025-01-09 08:53:46,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:53:46,590 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 08:53:46,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:53:46,591 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 08:53:46,592 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 08:53:46,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 08:53:47,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 08:53:47,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:53:47,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:53:47,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 08:53:47,509 INFO L279 TraceCheckSpWp]: Computing forward predicates...