./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.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-5.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 03532d804e91a228e512382776942639e7b4d586babdb4cf497abfe139412ab5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:19:00,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:19:00,501 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:19:00,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:19:00,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:19:00,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:19:00,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:19:00,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:19:00,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:19:00,526 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:19:00,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:19:00,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:19:00,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:19:00,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:19:00,527 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:19:00,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:19:00,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:19:00,528 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:19:00,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:19:00,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:19:00,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:19:00,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:19:00,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:19:00,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:19:00,528 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:19:00,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:19:00,529 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:19:00,529 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:19:00,529 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:19:00,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:19:00,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:19:00,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:19:00,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:00,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:19:00,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:19:00,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:19:00,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:19:00,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:00,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:19:00,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:19:00,530 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:19:00,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:19:00,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:19:00,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:19:00,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:19:00,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:19:00,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:19:00,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:19:00,531 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 -> 03532d804e91a228e512382776942639e7b4d586babdb4cf497abfe139412ab5 [2025-01-09 13:19:00,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:19:00,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:19:00,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:19:00,762 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:19:00,763 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:19:00,764 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-5.i [2025-01-09 13:19:01,903 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b1b51a21/e64a4d888df74ed283614a239a7c82d2/FLAG1abeadd5f [2025-01-09 13:19:02,149 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:19:02,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i [2025-01-09 13:19:02,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b1b51a21/e64a4d888df74ed283614a239a7c82d2/FLAG1abeadd5f [2025-01-09 13:19:02,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b1b51a21/e64a4d888df74ed283614a239a7c82d2 [2025-01-09 13:19:02,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:19:02,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:19:02,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:19:02,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:19:02,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:19:02,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:19:02" (1/1) ... [2025-01-09 13:19:02,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640e55e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:02, skipping insertion in model container [2025-01-09 13:19:02,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:19:02" (1/1) ... [2025-01-09 13:19:02,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:19:02,578 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-5.i[914,927] [2025-01-09 13:19:02,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:19:02,619 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:19:02,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i[914,927] [2025-01-09 13:19:02,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:19:02,668 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:19:02,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:02 WrapperNode [2025-01-09 13:19:02,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:19:02,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:19:02,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:19:02,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:19:02,677 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:19:02" (1/1) ... [2025-01-09 13:19:02,683 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:19:02" (1/1) ... [2025-01-09 13:19:02,707 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2025-01-09 13:19:02,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:19:02,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:19:02,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:19:02,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:19:02,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:02" (1/1) ... [2025-01-09 13:19:02,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:02" (1/1) ... [2025-01-09 13:19:02,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:02" (1/1) ... [2025-01-09 13:19:02,738 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:19:02,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:02" (1/1) ... [2025-01-09 13:19:02,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:02" (1/1) ... [2025-01-09 13:19:02,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:02" (1/1) ... [2025-01-09 13:19:02,745 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:02" (1/1) ... [2025-01-09 13:19:02,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:02" (1/1) ... [2025-01-09 13:19:02,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:02" (1/1) ... [2025-01-09 13:19:02,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:02" (1/1) ... [2025-01-09 13:19:02,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:19:02,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:19:02,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:19:02,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:19:02,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:02" (1/1) ... [2025-01-09 13:19:02,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:02,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:02,776 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:19:02,781 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:19:02,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:19:02,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:19:02,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:19:02,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:19:02,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:19:02,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:19:02,846 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:19:02,848 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:19:03,021 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 13:19:03,022 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:19:03,028 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:19:03,028 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:19:03,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:03 BoogieIcfgContainer [2025-01-09 13:19:03,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:19:03,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:19:03,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:19:03,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:19:03,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:19:02" (1/3) ... [2025-01-09 13:19:03,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da2d8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:19:03, skipping insertion in model container [2025-01-09 13:19:03,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:02" (2/3) ... [2025-01-09 13:19:03,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da2d8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:19:03, skipping insertion in model container [2025-01-09 13:19:03,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:03" (3/3) ... [2025-01-09 13:19:03,034 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-5.i [2025-01-09 13:19:03,043 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:19:03,045 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-5.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:19:03,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:19:03,090 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;@6fd85293, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:19:03,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:19:03,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:19:03,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 13:19:03,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:03,100 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:03,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:03,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1419796722, now seen corresponding path program 1 times [2025-01-09 13:19:03,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:03,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145016607] [2025-01-09 13:19:03,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:03,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:03,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 13:19:03,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 13:19:03,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:03,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:19:04,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:19:04,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145016607] [2025-01-09 13:19:04,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145016607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:04,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:19:04,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:19:04,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711275208] [2025-01-09 13:19:04,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:04,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:19:04,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:19:04,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:19:04,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:19:04,564 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:19:04,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:04,900 INFO L93 Difference]: Finished difference Result 206 states and 343 transitions. [2025-01-09 13:19:04,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:19:04,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-01-09 13:19:04,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:04,910 INFO L225 Difference]: With dead ends: 206 [2025-01-09 13:19:04,910 INFO L226 Difference]: Without dead ends: 149 [2025-01-09 13:19:04,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:19:04,916 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 107 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:04,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 190 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:19:04,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-09 13:19:04,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 73. [2025-01-09 13:19:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 13:19:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2025-01-09 13:19:04,963 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 93 [2025-01-09 13:19:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:04,965 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2025-01-09 13:19:04,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:19:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2025-01-09 13:19:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 13:19:04,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:04,968 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:04,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 13:19:04,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:04,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:04,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1417949680, now seen corresponding path program 1 times [2025-01-09 13:19:04,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:04,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144282527] [2025-01-09 13:19:04,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:04,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:04,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 13:19:05,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 13:19:05,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:05,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:06,653 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:19:06,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:19:06,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144282527] [2025-01-09 13:19:06,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144282527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:06,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:19:06,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 13:19:06,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697869651] [2025-01-09 13:19:06,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:06,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 13:19:06,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:19:06,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 13:19:06,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:19:06,656 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:19:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:07,391 INFO L93 Difference]: Finished difference Result 154 states and 213 transitions. [2025-01-09 13:19:07,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:19:07,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-01-09 13:19:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:07,393 INFO L225 Difference]: With dead ends: 154 [2025-01-09 13:19:07,393 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 13:19:07,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:19:07,394 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 96 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:07,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 255 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:19:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 13:19:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 144. [2025-01-09 13:19:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 93 states have internal predecessors, (107), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 13:19:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 203 transitions. [2025-01-09 13:19:07,429 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 203 transitions. Word has length 93 [2025-01-09 13:19:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:07,430 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 203 transitions. [2025-01-09 13:19:07,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:19:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 203 transitions. [2025-01-09 13:19:07,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 13:19:07,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:07,431 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:07,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:19:07,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:07,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:07,432 INFO L85 PathProgramCache]: Analyzing trace with hash 357057682, now seen corresponding path program 1 times [2025-01-09 13:19:07,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:07,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56734335] [2025-01-09 13:19:07,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:07,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:07,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 13:19:07,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 13:19:07,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:07,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:19:07,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:19:07,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56734335] [2025-01-09 13:19:07,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56734335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:07,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:19:07,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:19:07,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980949492] [2025-01-09 13:19:07,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:07,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:19:07,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:19:07,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:19:07,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:19:07,509 INFO L87 Difference]: Start difference. First operand 144 states and 203 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:19:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:07,529 INFO L93 Difference]: Finished difference Result 280 states and 397 transitions. [2025-01-09 13:19:07,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:19:07,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-01-09 13:19:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:07,532 INFO L225 Difference]: With dead ends: 280 [2025-01-09 13:19:07,533 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 13:19:07,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:19:07,534 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:07,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:19:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 13:19:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-01-09 13:19:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 86 states have (on average 1.127906976744186) internal successors, (97), 88 states have internal predecessors, (97), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 13:19:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 193 transitions. [2025-01-09 13:19:07,549 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 193 transitions. Word has length 93 [2025-01-09 13:19:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:07,549 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 193 transitions. [2025-01-09 13:19:07,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:19:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 193 transitions. [2025-01-09 13:19:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 13:19:07,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:07,550 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:07,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:19:07,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:07,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:07,551 INFO L85 PathProgramCache]: Analyzing trace with hash -739738352, now seen corresponding path program 1 times [2025-01-09 13:19:07,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:07,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18696948] [2025-01-09 13:19:07,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:07,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:07,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 13:19:07,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 13:19:07,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:07,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:19:07,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:19:07,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18696948] [2025-01-09 13:19:07,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18696948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:07,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:19:07,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:19:07,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988885723] [2025-01-09 13:19:07,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:07,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:19:07,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:19:07,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:19:07,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:19:07,600 INFO L87 Difference]: Start difference. First operand 139 states and 193 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:19:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:07,619 INFO L93 Difference]: Finished difference Result 243 states and 337 transitions. [2025-01-09 13:19:07,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:19:07,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-01-09 13:19:07,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:07,622 INFO L225 Difference]: With dead ends: 243 [2025-01-09 13:19:07,622 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 13:19:07,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:19:07,623 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:07,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:19:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 13:19:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-09 13:19:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 64 states have (on average 1.078125) internal successors, (69), 65 states have internal predecessors, (69), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 13:19:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 145 transitions. [2025-01-09 13:19:07,635 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 145 transitions. Word has length 93 [2025-01-09 13:19:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:07,635 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 145 transitions. [2025-01-09 13:19:07,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:19:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2025-01-09 13:19:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 13:19:07,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:07,636 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:07,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:19:07,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:07,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:07,637 INFO L85 PathProgramCache]: Analyzing trace with hash 771721706, now seen corresponding path program 1 times [2025-01-09 13:19:07,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:07,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412895385] [2025-01-09 13:19:07,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:07,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:07,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 13:19:07,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 13:19:07,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:07,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:10,306 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:19:10,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:19:10,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412895385] [2025-01-09 13:19:10,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412895385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:10,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:19:10,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:19:10,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746123197] [2025-01-09 13:19:10,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:10,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:19:10,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:19:10,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:19:10,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:19:10,308 INFO L87 Difference]: Start difference. First operand 107 states and 145 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:19:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:10,550 INFO L93 Difference]: Finished difference Result 127 states and 165 transitions. [2025-01-09 13:19:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:19:10,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2025-01-09 13:19:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:10,552 INFO L225 Difference]: With dead ends: 127 [2025-01-09 13:19:10,552 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 13:19:10,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:19:10,552 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:10,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 328 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:19:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 13:19:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2025-01-09 13:19:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 74 states have internal predecessors, (78), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 13:19:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2025-01-09 13:19:10,570 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 94 [2025-01-09 13:19:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:10,570 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2025-01-09 13:19:10,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:19:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2025-01-09 13:19:10,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 13:19:10,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:10,574 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:10,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:19:10,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:10,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:10,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1101376453, now seen corresponding path program 1 times [2025-01-09 13:19:10,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:10,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208629605] [2025-01-09 13:19:10,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:10,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:10,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 13:19:10,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 13:19:10,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:10,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:11,224 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:19:11,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:19:11,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208629605] [2025-01-09 13:19:11,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208629605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:11,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:19:11,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 13:19:11,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880907310] [2025-01-09 13:19:11,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:11,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:19:11,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:19:11,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:19:11,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:19:11,226 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:19:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:11,399 INFO L93 Difference]: Finished difference Result 140 states and 178 transitions. [2025-01-09 13:19:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 13:19:11,400 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2025-01-09 13:19:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:11,401 INFO L225 Difference]: With dead ends: 140 [2025-01-09 13:19:11,401 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 13:19:11,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:19:11,402 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 22 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:11,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 364 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:19:11,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 13:19:11,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2025-01-09 13:19:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 74 states have internal predecessors, (78), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 13:19:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2025-01-09 13:19:11,417 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 95 [2025-01-09 13:19:11,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:11,418 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2025-01-09 13:19:11,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 13:19:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2025-01-09 13:19:11,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 13:19:11,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:11,422 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:19:11,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:19:11,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:11,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:11,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1892918138, now seen corresponding path program 1 times [2025-01-09 13:19:11,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:11,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071211044] [2025-01-09 13:19:11,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:11,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:11,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 13:19:11,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 13:19:11,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:11,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:19:11,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:19:11,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071211044] [2025-01-09 13:19:11,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071211044] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:19:11,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697851863] [2025-01-09 13:19:11,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:11,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:19:11,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:11,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:19:11,508 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:19:11,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 13:19:11,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 13:19:11,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:11,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:11,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 13:19:11,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:19:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 817 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2025-01-09 13:19:11,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:19:11,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697851863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:11,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:19:11,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 13:19:11,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097975436] [2025-01-09 13:19:11,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:11,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:19:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:19:11,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:19:11,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:19:11,690 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 13:19:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:11,720 INFO L93 Difference]: Finished difference Result 152 states and 196 transitions. [2025-01-09 13:19:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:19:11,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 184 [2025-01-09 13:19:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:11,721 INFO L225 Difference]: With dead ends: 152 [2025-01-09 13:19:11,721 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 13:19:11,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 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:19:11,722 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:19:11,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 116 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:19:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 13:19:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 13:19:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 13:19:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 13:19:11,724 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 184 [2025-01-09 13:19:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:11,724 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 13:19:11,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 13:19:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 13:19:11,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 13:19:11,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:19:11,736 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:19:11,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:19:11,935 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:19:11,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 13:19:12,274 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:19:12,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:19:12 BoogieIcfgContainer [2025-01-09 13:19:12,288 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:19:12,289 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:19:12,289 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:19:12,289 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:19:12,290 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:03" (3/4) ... [2025-01-09 13:19:12,291 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 13:19:12,296 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 13:19:12,301 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 13:19:12,302 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 13:19:12,302 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 13:19:12,302 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 13:19:12,369 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 13:19:12,370 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 13:19:12,370 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:19:12,371 INFO L158 Benchmark]: Toolchain (without parser) took 9900.66ms. Allocated memory was 167.8MB in the beginning and 528.5MB in the end (delta: 360.7MB). Free memory was 128.2MB in the beginning and 447.1MB in the end (delta: -318.9MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2025-01-09 13:19:12,371 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:19:12,372 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.94ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 115.2MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:19:12,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.68ms. Allocated memory is still 167.8MB. Free memory was 115.2MB in the beginning and 113.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:19:12,376 INFO L158 Benchmark]: Boogie Preprocessor took 40.80ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 109.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:19:12,376 INFO L158 Benchmark]: RCFGBuilder took 277.56ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 91.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:19:12,377 INFO L158 Benchmark]: TraceAbstraction took 9258.25ms. Allocated memory was 167.8MB in the beginning and 528.5MB in the end (delta: 360.7MB). Free memory was 91.5MB in the beginning and 455.3MB in the end (delta: -363.8MB). Peak memory consumption was 270.4MB. Max. memory is 16.1GB. [2025-01-09 13:19:12,377 INFO L158 Benchmark]: Witness Printer took 81.03ms. Allocated memory is still 528.5MB. Free memory was 455.3MB in the beginning and 447.1MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:19:12,378 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 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.94ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 115.2MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.68ms. Allocated memory is still 167.8MB. Free memory was 115.2MB in the beginning and 113.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.80ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 109.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 277.56ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 91.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9258.25ms. Allocated memory was 167.8MB in the beginning and 528.5MB in the end (delta: 360.7MB). Free memory was 91.5MB in the beginning and 455.3MB in the end (delta: -363.8MB). Peak memory consumption was 270.4MB. Max. memory is 16.1GB. * Witness Printer took 81.03ms. Allocated memory is still 528.5MB. Free memory was 455.3MB in the beginning and 447.1MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 7, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 1491 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1042 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 714 IncrementalHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 449 mSDtfsCounter, 714 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=2, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 115 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 929 NumberOfCodeBlocks, 929 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 921 ConstructedInterpolants, 0 QuantifiedInterpolants, 3373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 393 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 5273/5274 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((0 <= 0) && (var_1_13 <= ((short) var_1_13 + var_1_8))) && (0 <= k_loop)) && (var_1_8 <= 10)) && (((short) var_1_13 + var_1_8) <= (255 + var_1_13))) && ((((((((long long) last_1_var_1_8 + var_1_4) + 1) <= ((int) var_1_7 + var_1_10)) && ((var_1_9 == 0) || (var_1_8 == var_1_12))) || ((((int) var_1_7 + var_1_10) <= ((long long) last_1_var_1_8 + var_1_4)) && ((var_1_9 == 0) || (var_1_8 == var_1_13)))) && (var_1_11 != 0)) || ((var_1_11 == 0) && ((var_1_9 == 0) || (var_1_8 == var_1_13))))) || ((1 <= k_loop) && (((var_1_8 == var_1_15) && (var_1_12 <= var_1_8)) || (((var_1_8 + 1) <= var_1_12) && (var_1_15 == var_1_12))))) RESULT: Ultimate proved your program to be correct! [2025-01-09 13:19:12,400 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 Writing output log to file Ultimate.log Result: TRUE