./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.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-70.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 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:21:41,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:21:41,455 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:21:41,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:21:41,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:21:41,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:21:41,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:21:41,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:21:41,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:21:41,483 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:21:41,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:21:41,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:21:41,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:21:41,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:21:41,485 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:21:41,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:21:41,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:21:41,485 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:21:41,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:21:41,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:21:41,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:21:41,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:21:41,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:21:41,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:21:41,486 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:21:41,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:21:41,486 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:21:41,486 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:21:41,486 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:21:41,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:21:41,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:21:41,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:21:41,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:21:41,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:21:41,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:21:41,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:21:41,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:21:41,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:21:41,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:21:41,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:21:41,488 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:21:41,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:21:41,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:21:41,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:21:41,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:21:41,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:21:41,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:21:41,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:21:41,488 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 -> 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 [2025-01-09 13:21:41,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:21:41,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:21:41,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:21:41,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:21:41,700 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:21:41,701 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-70.i [2025-01-09 13:21:42,813 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed99a6721/b19afbd7fb614a5eaf572361724c4aac/FLAG70f29b380 [2025-01-09 13:21:43,071 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:21:43,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2025-01-09 13:21:43,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed99a6721/b19afbd7fb614a5eaf572361724c4aac/FLAG70f29b380 [2025-01-09 13:21:43,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed99a6721/b19afbd7fb614a5eaf572361724c4aac [2025-01-09 13:21:43,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:21:43,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:21:43,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:21:43,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:21:43,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:21:43,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:21:43" (1/1) ... [2025-01-09 13:21:43,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4922ca42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:43, skipping insertion in model container [2025-01-09 13:21:43,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:21:43" (1/1) ... [2025-01-09 13:21:43,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:21:43,239 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-70.i[915,928] [2025-01-09 13:21:43,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:21:43,284 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:21:43,295 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2025-01-09 13:21:43,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:21:43,330 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:21:43,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:43 WrapperNode [2025-01-09 13:21:43,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:21:43,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:21:43,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:21:43,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:21:43,338 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:21:43" (1/1) ... [2025-01-09 13:21:43,344 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:21:43" (1/1) ... [2025-01-09 13:21:43,373 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2025-01-09 13:21:43,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:21:43,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:21:43,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:21:43,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:21:43,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:43" (1/1) ... [2025-01-09 13:21:43,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:43" (1/1) ... [2025-01-09 13:21:43,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:43" (1/1) ... [2025-01-09 13:21:43,400 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:21:43,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:43" (1/1) ... [2025-01-09 13:21:43,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:43" (1/1) ... [2025-01-09 13:21:43,404 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:43" (1/1) ... [2025-01-09 13:21:43,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:43" (1/1) ... [2025-01-09 13:21:43,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:43" (1/1) ... [2025-01-09 13:21:43,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:43" (1/1) ... [2025-01-09 13:21:43,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:43" (1/1) ... [2025-01-09 13:21:43,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:21:43,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:21:43,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:21:43,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:21:43,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:43" (1/1) ... [2025-01-09 13:21:43,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:21:43,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:21:43,446 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:21:43,448 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:21:43,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:21:43,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:21:43,462 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:21:43,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:21:43,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:21:43,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:21:43,504 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:21:43,505 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:21:43,699 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 13:21:43,700 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:21:43,706 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:21:43,706 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:21:43,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:21:43 BoogieIcfgContainer [2025-01-09 13:21:43,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:21:43,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:21:43,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:21:43,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:21:43,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:21:43" (1/3) ... [2025-01-09 13:21:43,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd2d449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:21:43, skipping insertion in model container [2025-01-09 13:21:43,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:43" (2/3) ... [2025-01-09 13:21:43,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd2d449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:21:43, skipping insertion in model container [2025-01-09 13:21:43,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:21:43" (3/3) ... [2025-01-09 13:21:43,716 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i [2025-01-09 13:21:43,726 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:21:43,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:21:43,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:21:43,769 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;@32d3f0b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:21:43,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:21:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 13:21:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 13:21:43,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:21:43,778 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:43,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:21:43,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:21:43,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1903866486, now seen corresponding path program 1 times [2025-01-09 13:21:43,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:21:43,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842773125] [2025-01-09 13:21:43,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:21:43,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:21:43,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 13:21:43,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 13:21:43,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:21:43,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:21:43,947 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 13:21:43,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:21:43,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842773125] [2025-01-09 13:21:43,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842773125] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:21:43,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053177203] [2025-01-09 13:21:43,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:21:43,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:21:43,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:21:43,951 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:21:43,952 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:21:44,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 13:21:44,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 13:21:44,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:21:44,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:21:44,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:21:44,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:21:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 13:21:44,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:21:44,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053177203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:21:44,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:21:44,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:21:44,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101893281] [2025-01-09 13:21:44,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:21:44,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:21:44,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:21:44,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:21:44,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:21:44,106 INFO L87 Difference]: Start difference. First operand has 58 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 13:21:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:21:44,123 INFO L93 Difference]: Finished difference Result 113 states and 176 transitions. [2025-01-09 13:21:44,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:21:44,124 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2025-01-09 13:21:44,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:21:44,129 INFO L225 Difference]: With dead ends: 113 [2025-01-09 13:21:44,130 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 13:21:44,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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:21:44,134 INFO L435 NwaCegarLoop]: 81 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, 81 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:21:44,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:21:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 13:21:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 13:21:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 13:21:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2025-01-09 13:21:44,165 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 90 [2025-01-09 13:21:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:21:44,166 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2025-01-09 13:21:44,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 13:21:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2025-01-09 13:21:44,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 13:21:44,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:21:44,170 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:44,176 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:21:44,371 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:21:44,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:21:44,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:21:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2132750732, now seen corresponding path program 1 times [2025-01-09 13:21:44,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:21:44,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021133868] [2025-01-09 13:21:44,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:21:44,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:21:44,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 13:21:44,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 13:21:44,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:21:44,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:21:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:21:44,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:21:44,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021133868] [2025-01-09 13:21:44,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021133868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:21:44,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:21:44,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:21:44,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416631200] [2025-01-09 13:21:44,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:21:44,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:21:44,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:21:44,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:21:44,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:21:44,714 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:21:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:21:44,896 INFO L93 Difference]: Finished difference Result 163 states and 227 transitions. [2025-01-09 13:21:44,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:21:44,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2025-01-09 13:21:44,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:21:44,899 INFO L225 Difference]: With dead ends: 163 [2025-01-09 13:21:44,899 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 13:21:44,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:21:44,901 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 93 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:21:44,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 199 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:21:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 13:21:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 84. [2025-01-09 13:21:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 13:21:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-01-09 13:21:44,917 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 90 [2025-01-09 13:21:44,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:21:44,918 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-01-09 13:21:44,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:21:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-01-09 13:21:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 13:21:44,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:21:44,922 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:44,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:21:44,922 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:21:44,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:21:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash -387209202, now seen corresponding path program 1 times [2025-01-09 13:21:44,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:21:44,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515414845] [2025-01-09 13:21:44,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:21:44,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:21:44,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 13:21:44,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 13:21:44,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:21:44,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:21:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:21:46,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:21:46,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515414845] [2025-01-09 13:21:46,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515414845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:21:46,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:21:46,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:21:46,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148396904] [2025-01-09 13:21:46,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:21:46,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:21:46,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:21:46,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:21:46,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:21:46,180 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:21:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:21:46,382 INFO L93 Difference]: Finished difference Result 192 states and 274 transitions. [2025-01-09 13:21:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:21:46,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2025-01-09 13:21:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:21:46,384 INFO L225 Difference]: With dead ends: 192 [2025-01-09 13:21:46,384 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 13:21:46,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:21:46,385 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 51 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:21:46,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 155 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:21:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 13:21:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2025-01-09 13:21:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 13:21:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-01-09 13:21:46,393 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 90 [2025-01-09 13:21:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:21:46,393 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-01-09 13:21:46,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:21:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-01-09 13:21:46,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 13:21:46,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:21:46,394 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:46,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:21:46,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:21:46,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:21:46,395 INFO L85 PathProgramCache]: Analyzing trace with hash -974015216, now seen corresponding path program 1 times [2025-01-09 13:21:46,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:21:46,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904731264] [2025-01-09 13:21:46,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:21:46,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:21:46,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 13:21:46,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 13:21:46,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:21:46,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:21:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:21:46,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:21:46,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904731264] [2025-01-09 13:21:46,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904731264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:21:46,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:21:46,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:21:46,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149378096] [2025-01-09 13:21:46,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:21:46,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:21:46,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:21:46,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:21:46,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:21:46,525 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:21:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:21:46,556 INFO L93 Difference]: Finished difference Result 204 states and 291 transitions. [2025-01-09 13:21:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:21:46,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2025-01-09 13:21:46,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:21:46,557 INFO L225 Difference]: With dead ends: 204 [2025-01-09 13:21:46,557 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 13:21:46,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:21:46,558 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 30 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:21:46,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 273 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:21:46,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 13:21:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2025-01-09 13:21:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 73 states have internal predecessors, (96), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 13:21:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2025-01-09 13:21:46,565 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 90 [2025-01-09 13:21:46,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:21:46,565 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2025-01-09 13:21:46,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:21:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2025-01-09 13:21:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 13:21:46,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:21:46,566 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:46,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:21:46,566 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:21:46,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:21:46,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1701406894, now seen corresponding path program 1 times [2025-01-09 13:21:46,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:21:46,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515622056] [2025-01-09 13:21:46,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:21:46,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:21:46,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 13:21:46,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 13:21:46,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:21:46,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:21:46,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:21:46,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 13:21:46,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 13:21:46,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:21:46,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:21:46,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:21:46,635 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:21:46,636 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:21:46,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:21:46,638 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 13:21:46,672 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:21:46,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:21:46 BoogieIcfgContainer [2025-01-09 13:21:46,675 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:21:46,675 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:21:46,675 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:21:46,675 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:21:46,676 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:21:43" (3/4) ... [2025-01-09 13:21:46,677 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:21:46,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:21:46,678 INFO L158 Benchmark]: Toolchain (without parser) took 3557.12ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 112.2MB in the beginning and 105.6MB in the end (delta: 6.6MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2025-01-09 13:21:46,678 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:21:46,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.97ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.4MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:21:46,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.03ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 96.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:21:46,679 INFO L158 Benchmark]: Boogie Preprocessor took 41.98ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 93.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:21:46,679 INFO L158 Benchmark]: RCFGBuilder took 287.54ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 74.9MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:21:46,679 INFO L158 Benchmark]: TraceAbstraction took 2965.48ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 74.4MB in the beginning and 105.6MB in the end (delta: -31.2MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2025-01-09 13:21:46,679 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 184.5MB. Free memory was 105.6MB in the beginning and 105.6MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:21:46,680 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.97ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.4MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.03ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 96.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.98ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 93.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 287.54ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 74.9MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2965.48ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 74.4MB in the beginning and 105.6MB in the end (delta: -31.2MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 184.5MB. Free memory was 105.6MB in the beginning and 105.6MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 1; [L25] unsigned short int var_1_4 = 19138; [L26] unsigned short int var_1_5 = 0; [L27] signed char var_1_6 = 25; [L28] signed long int var_1_7 = -50; [L29] double var_1_8 = 8.3; [L30] unsigned char var_1_9 = 128; [L31] unsigned char var_1_10 = 1; [L32] double var_1_11 = 256.2; VAL [isInitial=0, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L81] isInitial = 1 [L82] FCALL initially() [L83] int k_loop; [L84] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L84] COND TRUE k_loop < 1 [L85] FCALL updateLastVariables() [L86] CALL updateVariables() [L53] var_1_2 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L54] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L56] var_1_3 = __VERIFIER_nondet_ushort() [L57] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L57] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L59] var_1_4 = __VERIFIER_nondet_ushort() [L60] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L60] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L62] var_1_5 = __VERIFIER_nondet_ushort() [L63] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L63] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L65] var_1_9 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L66] RET assume_abort_if_not(var_1_9 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] CALL assume_abort_if_not(var_1_9 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] RET assume_abort_if_not(var_1_9 <= 255) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L68] var_1_10 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L69] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L72] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L86] RET updateVariables() [L87] CALL step() [L36] COND TRUE \read(var_1_2) [L37] var_1_1 = ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)) VAL [isInitial=1, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L39] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR var_1_5 << var_1_1 VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] COND FALSE !(stepLocal_0 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) [L43] var_1_7 = (var_1_5 + (var_1_1 + var_1_4)) VAL [isInitial=1, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=83/10, var_1_9=255] [L45] COND TRUE (var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3 [L46] var_1_8 = var_1_11 VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L48] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L87] RET step() [L88] CALL, EXPR property() [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR var_1_5 << var_1_1 VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77-L78] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4)))))) && (((var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3) ? (var_1_8 == ((double) var_1_11)) : 1) ; [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L19] reach_error() VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 5, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 708 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 398 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 248 IncrementalHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 310 mSDtfsCounter, 248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=3, InterpolantAutomatonStates: 17, 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, 4 MinimizatonAttempts, 63 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 543 NumberOfCodeBlocks, 543 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 445 ConstructedInterpolants, 0 QuantifiedInterpolants, 1621 SizeOfPredicates, 0 NumberOfNonLiveVariables, 211 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1536/1560 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:21:46,695 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-70.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 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:21:48,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:21:48,736 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:21:48,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:21:48,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:21:48,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:21:48,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:21:48,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:21:48,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:21:48,772 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:21:48,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:21:48,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:21:48,773 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:21:48,773 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:21:48,774 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:21:48,774 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:21:48,774 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:21:48,774 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:21:48,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:21:48,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:21:48,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:21:48,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:21:48,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:21:48,774 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:21:48,775 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:21:48,775 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:21:48,775 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:21:48,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:21:48,775 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:21:48,775 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:21:48,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:21:48,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:21:48,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:21:48,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:21:48,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:21:48,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:21:48,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:21:48,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:21:48,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:21:48,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:21:48,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:21:48,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:21:48,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:21:48,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:21:48,777 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:21:48,777 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:21:48,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:21:48,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:21:48,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:21:48,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:21:48,778 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 -> 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 [2025-01-09 13:21:49,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:21:49,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:21:49,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:21:49,071 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:21:49,071 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:21:49,071 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-70.i [2025-01-09 13:21:50,279 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2942cc8c5/9fefccc759324cd5b927511f2476faf3/FLAG0e05904d7 [2025-01-09 13:21:50,499 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:21:50,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2025-01-09 13:21:50,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2942cc8c5/9fefccc759324cd5b927511f2476faf3/FLAG0e05904d7 [2025-01-09 13:21:50,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2942cc8c5/9fefccc759324cd5b927511f2476faf3 [2025-01-09 13:21:50,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:21:50,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:21:50,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:21:50,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:21:50,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:21:50,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:21:50" (1/1) ... [2025-01-09 13:21:50,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2713b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:50, skipping insertion in model container [2025-01-09 13:21:50,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:21:50" (1/1) ... [2025-01-09 13:21:50,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:21:50,632 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-70.i[915,928] [2025-01-09 13:21:50,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:21:50,678 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:21:50,687 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-70.i[915,928] [2025-01-09 13:21:50,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:21:50,723 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:21:50,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:50 WrapperNode [2025-01-09 13:21:50,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:21:50,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:21:50,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:21:50,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:21:50,731 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:21:50" (1/1) ... [2025-01-09 13:21:50,742 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:21:50" (1/1) ... [2025-01-09 13:21:50,760 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2025-01-09 13:21:50,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:21:50,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:21:50,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:21:50,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:21:50,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:50" (1/1) ... [2025-01-09 13:21:50,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:50" (1/1) ... [2025-01-09 13:21:50,771 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:50" (1/1) ... [2025-01-09 13:21:50,782 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:21:50,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:50" (1/1) ... [2025-01-09 13:21:50,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:50" (1/1) ... [2025-01-09 13:21:50,790 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:50" (1/1) ... [2025-01-09 13:21:50,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:50" (1/1) ... [2025-01-09 13:21:50,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:50" (1/1) ... [2025-01-09 13:21:50,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:50" (1/1) ... [2025-01-09 13:21:50,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:50" (1/1) ... [2025-01-09 13:21:50,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:21:50,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:21:50,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:21:50,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:21:50,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:50" (1/1) ... [2025-01-09 13:21:50,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:21:50,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:21:50,833 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:21:50,841 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:21:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:21:50,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:21:50,858 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:21:50,858 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:21:50,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:21:50,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:21:50,904 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:21:50,905 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:21:51,029 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-09 13:21:51,029 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:21:51,037 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:21:51,037 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:21:51,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:21:51 BoogieIcfgContainer [2025-01-09 13:21:51,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:21:51,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:21:51,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:21:51,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:21:51,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:21:50" (1/3) ... [2025-01-09 13:21:51,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e8c101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:21:51, skipping insertion in model container [2025-01-09 13:21:51,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:21:50" (2/3) ... [2025-01-09 13:21:51,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e8c101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:21:51, skipping insertion in model container [2025-01-09 13:21:51,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:21:51" (3/3) ... [2025-01-09 13:21:51,045 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i [2025-01-09 13:21:51,056 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:21:51,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:21:51,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:21:51,096 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;@158e90db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:21:51,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:21:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 13:21:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 13:21:51,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:21:51,103 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:51,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:21:51,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:21:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1837142285, now seen corresponding path program 1 times [2025-01-09 13:21:51,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:21:51,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593106686] [2025-01-09 13:21:51,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:21:51,117 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:21:51,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:21:51,123 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:21:51,124 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:21:51,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 13:21:51,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 13:21:51,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:21:51,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:21:51,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 13:21:51,262 INFO L279 TraceCheckSpWp]: Computing forward predicates...