./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.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 1a326c2fbbb6417ff70dc27510b2ae37e6b7c3658951387b9f90f15bb09c3ae0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:23:31,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:23:31,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:23:31,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:23:31,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:23:31,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:23:31,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:23:31,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:23:31,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:23:31,458 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:23:31,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:23:31,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:23:31,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:23:31,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:23:31,459 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:23:31,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:23:31,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:23:31,460 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:23:31,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:23:31,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:23:31,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:23:31,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:23:31,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:23:31,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:23:31,461 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:23:31,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:23:31,461 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:23:31,461 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:23:31,461 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:23:31,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:23:31,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:23:31,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:23:31,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:23:31,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:23:31,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:23:31,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:23:31,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:23:31,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:23:31,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:23:31,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:23:31,462 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:23:31,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:23:31,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:23:31,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:23:31,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:23:31,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:23:31,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:23:31,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:23:31,462 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 -> 1a326c2fbbb6417ff70dc27510b2ae37e6b7c3658951387b9f90f15bb09c3ae0 [2025-01-09 13:23:31,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:23:31,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:23:31,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:23:31,747 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:23:31,747 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:23:31,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i [2025-01-09 13:23:33,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d1e96833/98cf0689a92d485c950a58b94100ce9d/FLAG53ddcc78d [2025-01-09 13:23:33,279 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:23:33,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i [2025-01-09 13:23:33,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d1e96833/98cf0689a92d485c950a58b94100ce9d/FLAG53ddcc78d [2025-01-09 13:23:33,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d1e96833/98cf0689a92d485c950a58b94100ce9d [2025-01-09 13:23:33,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:23:33,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:23:33,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:23:33,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:23:33,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:23:33,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120706b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33, skipping insertion in model container [2025-01-09 13:23:33,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:23:33,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i[915,928] [2025-01-09 13:23:33,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:23:33,538 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:23:33,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i[915,928] [2025-01-09 13:23:33,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:23:33,584 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:23:33,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33 WrapperNode [2025-01-09 13:23:33,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:23:33,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:23:33,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:23:33,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:23:33,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,644 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2025-01-09 13:23:33,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:23:33,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:23:33,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:23:33,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:23:33,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,675 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 13:23:33,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:23:33,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:23:33,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:23:33,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:23:33,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33" (1/1) ... [2025-01-09 13:23:33,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:23:33,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:23:33,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:23:33,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:23:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:23:33,759 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:23:33,760 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:23:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:23:33,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:23:33,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:23:33,813 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:23:33,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:23:34,101 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-09 13:23:34,101 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:23:34,112 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:23:34,114 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:23:34,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:23:34 BoogieIcfgContainer [2025-01-09 13:23:34,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:23:34,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:23:34,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:23:34,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:23:34,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:23:33" (1/3) ... [2025-01-09 13:23:34,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc7e6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:23:34, skipping insertion in model container [2025-01-09 13:23:34,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:33" (2/3) ... [2025-01-09 13:23:34,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc7e6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:23:34, skipping insertion in model container [2025-01-09 13:23:34,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:23:34" (3/3) ... [2025-01-09 13:23:34,124 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-83.i [2025-01-09 13:23:34,135 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:23:34,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-83.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:23:34,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:23:34,201 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;@1b7d5140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:23:34,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:23:34,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 13:23:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 13:23:34,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:23:34,216 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:23:34,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:23:34,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:23:34,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1022472270, now seen corresponding path program 1 times [2025-01-09 13:23:34,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:23:34,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506775283] [2025-01-09 13:23:34,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:34,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:23:34,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 13:23:34,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 13:23:34,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:34,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:23:34,488 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 13:23:34,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:23:34,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506775283] [2025-01-09 13:23:34,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506775283] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:23:34,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843918980] [2025-01-09 13:23:34,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:34,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:23:34,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:23:34,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:23:34,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:23:34,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 13:23:34,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 13:23:34,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:34,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:23:34,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:23:34,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:23:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 13:23:34,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:23:34,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843918980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:23:34,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:23:34,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:23:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825345278] [2025-01-09 13:23:34,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:23:34,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:23:34,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:23:34,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:23:34,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:23:34,683 INFO L87 Difference]: Start difference. First operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 13:23:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:23:34,700 INFO L93 Difference]: Finished difference Result 85 states and 138 transitions. [2025-01-09 13:23:34,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:23:34,701 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2025-01-09 13:23:34,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:23:34,706 INFO L225 Difference]: With dead ends: 85 [2025-01-09 13:23:34,706 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 13:23:34,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:23:34,711 INFO L435 NwaCegarLoop]: 61 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, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:23:34,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:23:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 13:23:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-09 13:23:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 13:23:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-01-09 13:23:34,764 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 94 [2025-01-09 13:23:34,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:23:34,765 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-01-09 13:23:34,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 13:23:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-01-09 13:23:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 13:23:34,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:23:34,771 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:23:34,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:23:34,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:23:34,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:23:34,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:23:34,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1988893140, now seen corresponding path program 1 times [2025-01-09 13:23:34,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:23:34,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911192179] [2025-01-09 13:23:34,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:34,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:23:34,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 13:23:35,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 13:23:35,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:35,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:23:35,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460946249] [2025-01-09 13:23:35,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:35,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:23:35,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:23:35,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:23:35,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:23:35,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 13:23:35,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 13:23:35,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:35,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:23:35,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:23:35,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 13:23:35,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 13:23:35,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:35,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:23:35,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:23:35,336 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:23:35,337 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:23:35,349 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 13:23:35,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:23:35,542 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 13:23:35,596 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:23:35,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:23:35 BoogieIcfgContainer [2025-01-09 13:23:35,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:23:35,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:23:35,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:23:35,603 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:23:35,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:23:34" (3/4) ... [2025-01-09 13:23:35,606 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:23:35,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:23:35,609 INFO L158 Benchmark]: Toolchain (without parser) took 2303.12ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 75.0MB in the end (delta: 30.7MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2025-01-09 13:23:35,609 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:23:35,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.60ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 92.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:23:35,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.98ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 89.1MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:23:35,610 INFO L158 Benchmark]: Boogie Preprocessor took 54.40ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 84.6MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:23:35,612 INFO L158 Benchmark]: RCFGBuilder took 414.81ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 67.5MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:23:35,612 INFO L158 Benchmark]: TraceAbstraction took 1484.67ms. Allocated memory is still 142.6MB. Free memory was 66.6MB in the beginning and 75.1MB in the end (delta: -8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:23:35,612 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 75.0MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:23:35,614 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.96ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.60ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 92.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.98ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 89.1MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.40ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 84.6MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 414.81ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 67.5MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1484.67ms. Allocated memory is still 142.6MB. Free memory was 66.6MB in the beginning and 75.1MB in the end (delta: -8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 75.0MB in the end (delta: 41.6kB). 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 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 25; [L25] unsigned char var_1_4 = 4; [L26] double var_1_8 = 49.8; [L27] double var_1_9 = 127.8; [L28] double var_1_10 = 7.2; [L29] signed char var_1_11 = -1; [L30] signed char var_1_12 = 2; [L31] signed char var_1_13 = 4; [L32] signed char var_1_14 = 16; [L33] unsigned short int var_1_15 = 0; VAL [isInitial=0, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L87] isInitial = 1 [L88] FCALL initially() [L89] int k_loop; [L90] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L90] COND TRUE k_loop < 1 [L91] FCALL updateLastVariables() [L92] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L58] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L58] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L59] var_1_3 = __VERIFIER_nondet_ushort() [L60] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L60] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L61] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L61] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L64] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L64] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L65] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5, var_1_9=639/5] [L65] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5, var_1_9=639/5] [L66] var_1_9 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L67] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L68] var_1_10 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L69] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L70] var_1_12 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L71] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L72] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L72] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L73] var_1_13 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L74] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L75] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L75] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L76] var_1_14 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L78] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L78] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L92] RET updateVariables() [L93] CALL step() [L37] var_1_11 = ((var_1_12 + var_1_13) - ((((25) < (var_1_14)) ? (25) : (var_1_14)))) [L38] var_1_15 = var_1_14 [L39] signed long int stepLocal_0 = var_1_3 / var_1_4; VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L40] COND TRUE \read(var_1_2) [L41] var_1_1 = (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=255, var_1_8=249/5] [L49] COND TRUE var_1_11 >= ((var_1_3 / var_1_4) + (var_1_1 * var_1_11)) [L50] var_1_8 = (var_1_9 + ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=255] [L93] RET step() [L94] CALL, EXPR property() [L83-L84] return (((var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((var_1_15 * var_1_15)) < (var_1_11)) ? ((var_1_15 * var_1_15)) : (var_1_11)))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) 5)))) && ((var_1_11 >= ((var_1_3 / var_1_4) + (var_1_1 * var_1_11))) ? (var_1_8 == ((double) (var_1_9 + ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))) : (var_1_8 == ((double) var_1_9)))) && (var_1_11 == ((signed char) ((var_1_12 + var_1_13) - ((((25) < (var_1_14)) ? (25) : (var_1_14))))))) && (var_1_15 == ((unsigned short int) var_1_14)) ; VAL [\result=0, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=255] [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=255] [L19] reach_error() VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 61 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 186 SizeOfPredicates, 0 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 812/840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 13:23:35,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.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 1a326c2fbbb6417ff70dc27510b2ae37e6b7c3658951387b9f90f15bb09c3ae0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:23:37,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:23:37,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:23:37,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:23:37,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:23:38,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:23:38,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:23:38,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:23:38,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:23:38,038 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:23:38,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:23:38,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:23:38,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:23:38,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:23:38,039 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:23:38,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:23:38,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:23:38,041 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:23:38,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:23:38,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:23:38,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:23:38,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:23:38,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:23:38,041 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:23:38,041 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:23:38,041 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:23:38,041 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:23:38,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:23:38,041 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:23:38,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:23:38,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:23:38,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:23:38,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:23:38,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:23:38,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:23:38,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:23:38,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:23:38,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:23:38,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:23:38,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:23:38,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:23:38,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:23:38,042 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:23:38,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:23:38,043 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:23:38,043 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:23:38,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:23:38,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:23:38,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:23:38,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:23:38,043 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 -> 1a326c2fbbb6417ff70dc27510b2ae37e6b7c3658951387b9f90f15bb09c3ae0 [2025-01-09 13:23:38,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:23:38,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:23:38,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:23:38,397 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:23:38,398 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:23:38,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i [2025-01-09 13:23:39,874 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc41f4fd7/6d7ab5de9b294e0a916be3cf12aefccb/FLAG5e5e81261 [2025-01-09 13:23:40,119 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:23:40,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i [2025-01-09 13:23:40,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc41f4fd7/6d7ab5de9b294e0a916be3cf12aefccb/FLAG5e5e81261 [2025-01-09 13:23:40,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc41f4fd7/6d7ab5de9b294e0a916be3cf12aefccb [2025-01-09 13:23:40,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:23:40,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:23:40,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:23:40,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:23:40,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:23:40,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ee57a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40, skipping insertion in model container [2025-01-09 13:23:40,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:23:40,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i[915,928] [2025-01-09 13:23:40,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:23:40,370 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:23:40,382 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i[915,928] [2025-01-09 13:23:40,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:23:40,432 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:23:40,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40 WrapperNode [2025-01-09 13:23:40,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:23:40,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:23:40,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:23:40,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:23:40,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,481 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2025-01-09 13:23:40,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:23:40,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:23:40,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:23:40,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:23:40,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,517 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 13:23:40,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,527 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,528 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:23:40,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:23:40,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:23:40,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:23:40,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40" (1/1) ... [2025-01-09 13:23:40,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:23:40,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:23:40,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:23:40,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:23:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:23:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:23:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:23:40,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:23:40,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:23:40,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:23:40,681 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:23:40,683 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:23:41,560 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-09 13:23:41,560 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:23:41,568 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:23:41,568 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:23:41,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:23:41 BoogieIcfgContainer [2025-01-09 13:23:41,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:23:41,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:23:41,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:23:41,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:23:41,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:23:40" (1/3) ... [2025-01-09 13:23:41,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b10f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:23:41, skipping insertion in model container [2025-01-09 13:23:41,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:23:40" (2/3) ... [2025-01-09 13:23:41,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b10f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:23:41, skipping insertion in model container [2025-01-09 13:23:41,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:23:41" (3/3) ... [2025-01-09 13:23:41,578 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-83.i [2025-01-09 13:23:41,593 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:23:41,597 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-83.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:23:41,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:23:41,667 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;@70f80410, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:23:41,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:23:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 13:23:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 13:23:41,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:23:41,680 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:23:41,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:23:41,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:23:41,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1022472270, now seen corresponding path program 1 times [2025-01-09 13:23:41,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:23:41,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899388365] [2025-01-09 13:23:41,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:41,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:23:41,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:23:41,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:23:41,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 13:23:41,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 13:23:41,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 13:23:41,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:41,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:23:41,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:23:41,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:23:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 13:23:42,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:23:42,009 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:23:42,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899388365] [2025-01-09 13:23:42,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899388365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:23:42,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:23:42,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:23:42,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410477782] [2025-01-09 13:23:42,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:23:42,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:23:42,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:23:42,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:23:42,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:23:42,038 INFO L87 Difference]: Start difference. First operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 13:23:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:23:42,058 INFO L93 Difference]: Finished difference Result 85 states and 138 transitions. [2025-01-09 13:23:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:23:42,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2025-01-09 13:23:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:23:42,065 INFO L225 Difference]: With dead ends: 85 [2025-01-09 13:23:42,065 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 13:23:42,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:23:42,073 INFO L435 NwaCegarLoop]: 61 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, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:23:42,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:23:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 13:23:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-09 13:23:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 13:23:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-01-09 13:23:42,121 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 94 [2025-01-09 13:23:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:23:42,122 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-01-09 13:23:42,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 13:23:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-01-09 13:23:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 13:23:42,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:23:42,125 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:23:42,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 13:23:42,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:23:42,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:23:42,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:23:42,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1988893140, now seen corresponding path program 1 times [2025-01-09 13:23:42,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:23:42,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604080143] [2025-01-09 13:23:42,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:23:42,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:23:42,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:23:42,333 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:23:42,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 13:23:42,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 13:23:42,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 13:23:42,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:23:42,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:23:42,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 13:23:42,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:24:22,456 WARN L286 SmtUtils]: Spent 15.77s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)