./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/reducercommutativity/rangesum20.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:32:22,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:32:22,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 13:32:22,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:32:22,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:32:22,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:32:22,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:32:22,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:32:22,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:32:22,511 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:32:22,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:32:22,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:32:22,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:32:22,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:32:22,512 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:32:22,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:32:22,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:32:22,512 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:32:22,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:32:22,513 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:32:22,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:32:22,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:32:22,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:32:22,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:32:22,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:32:22,514 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/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 -> 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a [2025-03-16 13:32:22,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:32:22,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:32:22,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:32:22,756 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:32:22,756 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:32:22,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum20.i [2025-03-16 13:32:23,881 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607ba8f44/c8f34c74350e4e87ac9e1b67d60d6d02/FLAGf4ac2afed [2025-03-16 13:32:24,110 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:32:24,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum20.i [2025-03-16 13:32:24,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607ba8f44/c8f34c74350e4e87ac9e1b67d60d6d02/FLAGf4ac2afed [2025-03-16 13:32:24,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/607ba8f44/c8f34c74350e4e87ac9e1b67d60d6d02 [2025-03-16 13:32:24,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:32:24,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:32:24,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:32:24,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:32:24,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:32:24,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:32:24" (1/1) ... [2025-03-16 13:32:24,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c94dd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24, skipping insertion in model container [2025-03-16 13:32:24,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:32:24" (1/1) ... [2025-03-16 13:32:24,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:32:24,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum20.i[1465,1478] [2025-03-16 13:32:24,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:32:24,585 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:32:24,599 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum20.i[1465,1478] [2025-03-16 13:32:24,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:32:24,610 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:32:24,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24 WrapperNode [2025-03-16 13:32:24,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:32:24,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:32:24,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:32:24,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:32:24,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24" (1/1) ... [2025-03-16 13:32:24,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24" (1/1) ... [2025-03-16 13:32:24,629 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2025-03-16 13:32:24,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:32:24,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:32:24,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:32:24,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:32:24,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24" (1/1) ... [2025-03-16 13:32:24,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24" (1/1) ... [2025-03-16 13:32:24,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24" (1/1) ... [2025-03-16 13:32:24,644 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-16 13:32:24,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24" (1/1) ... [2025-03-16 13:32:24,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24" (1/1) ... [2025-03-16 13:32:24,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24" (1/1) ... [2025-03-16 13:32:24,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24" (1/1) ... [2025-03-16 13:32:24,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24" (1/1) ... [2025-03-16 13:32:24,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24" (1/1) ... [2025-03-16 13:32:24,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:32:24,651 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:32:24,651 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:32:24,651 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:32:24,652 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24" (1/1) ... [2025-03-16 13:32:24,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:32:24,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:24,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 13:32:24,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 13:32:24,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:32:24,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:32:24,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:32:24,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 13:32:24,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:32:24,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:32:24,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:32:24,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:32:24,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:32:24,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:32:24,693 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2025-03-16 13:32:24,693 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2025-03-16 13:32:24,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 13:32:24,747 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:32:24,748 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:32:24,848 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-16 13:32:24,880 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-16 13:32:24,880 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:32:24,890 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:32:24,890 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:32:24,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:32:24 BoogieIcfgContainer [2025-03-16 13:32:24,890 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:32:24,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:32:24,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:32:24,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:32:24,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:32:24" (1/3) ... [2025-03-16 13:32:24,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc9bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:32:24, skipping insertion in model container [2025-03-16 13:32:24,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:24" (2/3) ... [2025-03-16 13:32:24,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc9bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:32:24, skipping insertion in model container [2025-03-16 13:32:24,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:32:24" (3/3) ... [2025-03-16 13:32:24,899 INFO L128 eAbstractionObserver]: Analyzing ICFG rangesum20.i [2025-03-16 13:32:24,909 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:32:24,910 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rangesum20.i that has 2 procedures, 23 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-16 13:32:24,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:32:24,958 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;@4f17340a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:32:24,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:32:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 13:32:24,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:24,967 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:24,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:24,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:24,970 INFO L85 PathProgramCache]: Analyzing trace with hash 590336288, now seen corresponding path program 1 times [2025-03-16 13:32:24,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:24,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966259792] [2025-03-16 13:32:24,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:24,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:25,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 13:32:25,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 13:32:25,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:25,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 13:32:25,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:25,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966259792] [2025-03-16 13:32:25,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966259792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:25,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:32:25,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 13:32:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335701265] [2025-03-16 13:32:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:25,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:32:25,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:25,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:32:25,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 13:32:25,216 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:32:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:25,232 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2025-03-16 13:32:25,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:32:25,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2025-03-16 13:32:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:25,239 INFO L225 Difference]: With dead ends: 45 [2025-03-16 13:32:25,240 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 13:32:25,242 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-03-16 13:32:25,245 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:25,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 13:32:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-16 13:32:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2025-03-16 13:32:25,276 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 26 [2025-03-16 13:32:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:25,278 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-03-16 13:32:25,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:32:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2025-03-16 13:32:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 13:32:25,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:25,280 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:25,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 13:32:25,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:25,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:25,282 INFO L85 PathProgramCache]: Analyzing trace with hash -527850959, now seen corresponding path program 1 times [2025-03-16 13:32:25,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:25,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516259187] [2025-03-16 13:32:25,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:25,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:25,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 13:32:25,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 13:32:25,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:25,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 13:32:25,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:25,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516259187] [2025-03-16 13:32:25,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516259187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:25,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120745670] [2025-03-16 13:32:25,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:25,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:25,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:25,420 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:25,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 13:32:25,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 13:32:25,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 13:32:25,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:25,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:25,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 13:32:25,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 13:32:25,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:32:25,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120745670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:25,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:32:25,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 13:32:25,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435119240] [2025-03-16 13:32:25,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:25,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:32:25,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:25,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:32:25,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:25,537 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:25,549 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2025-03-16 13:32:25,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:32:25,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-16 13:32:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:25,550 INFO L225 Difference]: With dead ends: 39 [2025-03-16 13:32:25,550 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 13:32:25,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:25,551 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:25,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 13:32:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-16 13:32:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-16 13:32:25,558 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 27 [2025-03-16 13:32:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:25,558 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-16 13:32:25,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-03-16 13:32:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 13:32:25,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:25,559 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:25,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 13:32:25,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:25,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:25,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:25,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1092725448, now seen corresponding path program 1 times [2025-03-16 13:32:25,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:25,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143090752] [2025-03-16 13:32:25,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:25,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:25,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 13:32:25,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 13:32:25,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:25,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-16 13:32:25,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:25,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143090752] [2025-03-16 13:32:25,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143090752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:25,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916568668] [2025-03-16 13:32:25,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:25,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:25,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:25,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:25,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 13:32:25,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 13:32:25,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 13:32:25,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:25,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:25,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 13:32:25,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 13:32:25,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:32:25,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916568668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:25,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:32:25,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 13:32:25,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587331454] [2025-03-16 13:32:25,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:25,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:32:25,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:25,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:32:25,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:25,944 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:25,955 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2025-03-16 13:32:25,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:32:25,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-03-16 13:32:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:25,956 INFO L225 Difference]: With dead ends: 37 [2025-03-16 13:32:25,956 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 13:32:25,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:25,958 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 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-03-16 13:32:25,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:25,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 13:32:25,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-16 13:32:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2025-03-16 13:32:25,964 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 36 [2025-03-16 13:32:25,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:25,964 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-03-16 13:32:25,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2025-03-16 13:32:25,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 13:32:25,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:25,965 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:25,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:26,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 13:32:26,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:26,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:26,166 INFO L85 PathProgramCache]: Analyzing trace with hash -144785531, now seen corresponding path program 1 times [2025-03-16 13:32:26,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:26,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417537193] [2025-03-16 13:32:26,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:26,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:26,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 13:32:26,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:32:26,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:26,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:26,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:26,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417537193] [2025-03-16 13:32:26,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417537193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:26,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421897816] [2025-03-16 13:32:26,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:26,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:26,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:26,248 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:26,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 13:32:26,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 13:32:26,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:32:26,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:26,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:26,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 13:32:26,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 13:32:26,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:32:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421897816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:26,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:32:26,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 13:32:26,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062689474] [2025-03-16 13:32:26,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:26,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:32:26,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:26,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:32:26,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:26,341 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:26,352 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2025-03-16 13:32:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:32:26,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-16 13:32:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:26,354 INFO L225 Difference]: With dead ends: 46 [2025-03-16 13:32:26,355 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 13:32:26,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:26,355 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:26,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:26,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 13:32:26,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 13:32:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-16 13:32:26,360 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 37 [2025-03-16 13:32:26,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:26,360 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-16 13:32:26,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-03-16 13:32:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 13:32:26,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:26,361 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:26,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 13:32:26,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:26,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:26,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1367965278, now seen corresponding path program 1 times [2025-03-16 13:32:26,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:26,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947845403] [2025-03-16 13:32:26,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:26,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:26,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 13:32:26,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:32:26,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:26,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:26,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:26,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947845403] [2025-03-16 13:32:26,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947845403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:26,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260335274] [2025-03-16 13:32:26,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:26,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:26,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:26,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:26,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 13:32:26,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 13:32:26,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:32:26,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:26,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:26,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 13:32:26,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:26,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:26,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260335274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:26,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:26,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-16 13:32:26,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68273584] [2025-03-16 13:32:26,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:26,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 13:32:26,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:26,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 13:32:26,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:32:26,760 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 13:32:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:26,775 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2025-03-16 13:32:26,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:32:26,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 37 [2025-03-16 13:32:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:26,776 INFO L225 Difference]: With dead ends: 54 [2025-03-16 13:32:26,776 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 13:32:26,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:32:26,777 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:26,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 13:32:26,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-16 13:32:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-03-16 13:32:26,781 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 37 [2025-03-16 13:32:26,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:26,781 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-16 13:32:26,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 13:32:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-03-16 13:32:26,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 13:32:26,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:26,782 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:26,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:26,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:26,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:26,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:26,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1245446639, now seen corresponding path program 2 times [2025-03-16 13:32:26,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:26,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666900651] [2025-03-16 13:32:26,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:26,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:26,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-16 13:32:27,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 13:32:27,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:27,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 13:32:27,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:27,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666900651] [2025-03-16 13:32:27,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666900651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:27,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257293597] [2025-03-16 13:32:27,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:27,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:27,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:27,045 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:27,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 13:32:27,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-16 13:32:27,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 13:32:27,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:27,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:27,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:32:27,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:27,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:27,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257293597] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:27,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:27,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 7] total 14 [2025-03-16 13:32:27,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404804507] [2025-03-16 13:32:27,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:27,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 13:32:27,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:27,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 13:32:27,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-16 13:32:27,215 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:32:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:27,255 INFO L93 Difference]: Finished difference Result 64 states and 90 transitions. [2025-03-16 13:32:27,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 13:32:27,257 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 40 [2025-03-16 13:32:27,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:27,258 INFO L225 Difference]: With dead ends: 64 [2025-03-16 13:32:27,259 INFO L226 Difference]: Without dead ends: 40 [2025-03-16 13:32:27,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-16 13:32:27,260 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:27,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 114 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:27,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-16 13:32:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2025-03-16 13:32:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-03-16 13:32:27,265 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 40 [2025-03-16 13:32:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:27,265 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-03-16 13:32:27,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:32:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-03-16 13:32:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 13:32:27,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:27,266 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:27,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:27,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:27,467 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:27,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:27,467 INFO L85 PathProgramCache]: Analyzing trace with hash -364195056, now seen corresponding path program 3 times [2025-03-16 13:32:27,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:27,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922400661] [2025-03-16 13:32:27,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:32:27,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:27,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 6 equivalence classes. [2025-03-16 13:32:27,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 55 statements. [2025-03-16 13:32:27,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-16 13:32:27,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-16 13:32:27,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:27,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922400661] [2025-03-16 13:32:27,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922400661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:27,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:32:27,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:32:27,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141536333] [2025-03-16 13:32:27,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:27,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:32:27,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:27,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:32:27,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:32:27,515 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:32:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:27,532 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2025-03-16 13:32:27,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:32:27,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2025-03-16 13:32:27,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:27,534 INFO L225 Difference]: With dead ends: 68 [2025-03-16 13:32:27,535 INFO L226 Difference]: Without dead ends: 42 [2025-03-16 13:32:27,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:32:27,536 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:27,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 40 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:27,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-16 13:32:27,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2025-03-16 13:32:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-16 13:32:27,543 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 55 [2025-03-16 13:32:27,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:27,544 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-16 13:32:27,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:32:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-03-16 13:32:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 13:32:27,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:27,545 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:27,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 13:32:27,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:27,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:27,545 INFO L85 PathProgramCache]: Analyzing trace with hash -236490255, now seen corresponding path program 1 times [2025-03-16 13:32:27,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:27,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98089626] [2025-03-16 13:32:27,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:27,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:27,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 13:32:27,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 13:32:27,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:27,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-16 13:32:27,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:27,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98089626] [2025-03-16 13:32:27,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98089626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:27,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804315543] [2025-03-16 13:32:27,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:27,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:27,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:27,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:27,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 13:32:27,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 13:32:27,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 13:32:27,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:27,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:27,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 13:32:27,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-16 13:32:27,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-16 13:32:28,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804315543] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:28,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:28,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 12, 13] total 24 [2025-03-16 13:32:28,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176800867] [2025-03-16 13:32:28,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:28,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 13:32:28,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:28,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 13:32:28,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2025-03-16 13:32:28,070 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 13:32:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:28,113 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2025-03-16 13:32:28,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 13:32:28,114 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 64 [2025-03-16 13:32:28,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:28,115 INFO L225 Difference]: With dead ends: 73 [2025-03-16 13:32:28,115 INFO L226 Difference]: Without dead ends: 48 [2025-03-16 13:32:28,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2025-03-16 13:32:28,116 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:28,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-16 13:32:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-16 13:32:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-03-16 13:32:28,123 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 64 [2025-03-16 13:32:28,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:28,123 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-03-16 13:32:28,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 13:32:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-03-16 13:32:28,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 13:32:28,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:28,124 INFO L218 NwaCegarLoop]: trace histogram [20, 9, 9, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:28,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:28,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:28,325 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:28,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:28,326 INFO L85 PathProgramCache]: Analyzing trace with hash 227571322, now seen corresponding path program 2 times [2025-03-16 13:32:28,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:28,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060133961] [2025-03-16 13:32:28,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:28,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:28,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-16 13:32:28,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 13:32:28,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:28,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-03-16 13:32:28,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:28,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060133961] [2025-03-16 13:32:28,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060133961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:28,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047301149] [2025-03-16 13:32:28,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:28,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:28,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:28,450 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:28,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 13:32:28,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-16 13:32:28,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 13:32:28,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:28,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:28,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 13:32:28,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-16 13:32:28,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-03-16 13:32:28,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047301149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:28,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:28,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-16 13:32:28,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70829067] [2025-03-16 13:32:28,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:28,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 13:32:28,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:28,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 13:32:28,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-16 13:32:28,599 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:32:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:28,629 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2025-03-16 13:32:28,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 13:32:28,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2025-03-16 13:32:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:28,632 INFO L225 Difference]: With dead ends: 85 [2025-03-16 13:32:28,632 INFO L226 Difference]: Without dead ends: 60 [2025-03-16 13:32:28,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-16 13:32:28,632 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:28,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-16 13:32:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-16 13:32:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2025-03-16 13:32:28,638 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 75 [2025-03-16 13:32:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:28,638 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2025-03-16 13:32:28,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:32:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2025-03-16 13:32:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 13:32:28,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:28,639 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 20, 18, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:28,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 13:32:28,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:28,840 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:28,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:28,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1843837114, now seen corresponding path program 3 times [2025-03-16 13:32:28,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:28,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334272110] [2025-03-16 13:32:28,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:32:28,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:28,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 111 statements into 16 equivalence classes. [2025-03-16 13:32:28,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 111 statements. [2025-03-16 13:32:28,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 13:32:28,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 921 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2025-03-16 13:32:28,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:28,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334272110] [2025-03-16 13:32:28,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334272110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:28,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462910771] [2025-03-16 13:32:28,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:32:28,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:28,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:28,921 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:28,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 13:32:28,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 111 statements into 16 equivalence classes. [2025-03-16 13:32:29,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 111 statements. [2025-03-16 13:32:29,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 13:32:29,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:29,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 13:32:29,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 921 backedges. 332 proven. 3 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2025-03-16 13:32:29,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 921 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2025-03-16 13:32:29,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462910771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:29,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:29,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-16 13:32:29,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307330608] [2025-03-16 13:32:29,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:29,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 13:32:29,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:29,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 13:32:29,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-16 13:32:29,078 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:32:29,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:29,089 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2025-03-16 13:32:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 13:32:29,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 111 [2025-03-16 13:32:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:29,090 INFO L225 Difference]: With dead ends: 95 [2025-03-16 13:32:29,090 INFO L226 Difference]: Without dead ends: 64 [2025-03-16 13:32:29,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-16 13:32:29,090 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:29,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-16 13:32:29,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-16 13:32:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2025-03-16 13:32:29,095 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 111 [2025-03-16 13:32:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:29,095 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2025-03-16 13:32:29,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:32:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2025-03-16 13:32:29,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 13:32:29,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:29,098 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 20, 18, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:29,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 13:32:29,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 13:32:29,299 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:29,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:29,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2001137274, now seen corresponding path program 4 times [2025-03-16 13:32:29,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:29,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160947335] [2025-03-16 13:32:29,299 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:32:29,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:29,315 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 115 statements into 2 equivalence classes. [2025-03-16 13:32:29,319 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 56 of 115 statements. [2025-03-16 13:32:29,319 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 13:32:29,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 13 proven. 387 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2025-03-16 13:32:29,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:29,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160947335] [2025-03-16 13:32:29,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160947335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:29,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114271572] [2025-03-16 13:32:29,385 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:32:29,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:29,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:29,387 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:29,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 13:32:29,453 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 115 statements into 2 equivalence classes. [2025-03-16 13:32:29,464 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 56 of 115 statements. [2025-03-16 13:32:29,464 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 13:32:29,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:29,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 13:32:29,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 309 proven. 57 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-16 13:32:29,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 13 proven. 387 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2025-03-16 13:32:29,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114271572] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:29,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:29,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-16 13:32:29,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691704092] [2025-03-16 13:32:29,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:29,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 13:32:29,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:29,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 13:32:29,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-16 13:32:29,575 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:32:29,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:29,612 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2025-03-16 13:32:29,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 13:32:29,613 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2025-03-16 13:32:29,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:29,613 INFO L225 Difference]: With dead ends: 120 [2025-03-16 13:32:29,613 INFO L226 Difference]: Without dead ends: 79 [2025-03-16 13:32:29,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 223 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-16 13:32:29,614 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:29,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-16 13:32:29,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-16 13:32:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0675675675675675) internal successors, (79), 74 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2025-03-16 13:32:29,619 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 115 [2025-03-16 13:32:29,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:29,619 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2025-03-16 13:32:29,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:32:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2025-03-16 13:32:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-16 13:32:29,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:29,620 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 33, 20, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:29,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 13:32:29,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:29,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:29,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash -476126689, now seen corresponding path program 5 times [2025-03-16 13:32:29,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:29,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308515843] [2025-03-16 13:32:29,821 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:32:29,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:29,839 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 160 statements into 26 equivalence classes. [2025-03-16 13:32:29,844 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 25 of 160 statements. [2025-03-16 13:32:29,844 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-16 13:32:29,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 53 proven. 132 refuted. 0 times theorem prover too weak. 2059 trivial. 0 not checked. [2025-03-16 13:32:29,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308515843] [2025-03-16 13:32:29,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308515843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:29,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374121762] [2025-03-16 13:32:29,885 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:32:29,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:29,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:29,886 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:29,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 13:32:29,959 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 160 statements into 26 equivalence classes. [2025-03-16 13:32:29,967 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 25 of 160 statements. [2025-03-16 13:32:29,967 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-16 13:32:29,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:29,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:32:29,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1011 proven. 15 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2025-03-16 13:32:29,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 95 proven. 293 refuted. 0 times theorem prover too weak. 1856 trivial. 0 not checked. [2025-03-16 13:32:30,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374121762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:30,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:30,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2025-03-16 13:32:30,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102958683] [2025-03-16 13:32:30,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:30,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 13:32:30,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:30,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 13:32:30,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-16 13:32:30,065 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:32:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:30,107 INFO L93 Difference]: Finished difference Result 159 states and 188 transitions. [2025-03-16 13:32:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 13:32:30,107 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 160 [2025-03-16 13:32:30,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:30,108 INFO L225 Difference]: With dead ends: 159 [2025-03-16 13:32:30,109 INFO L226 Difference]: Without dead ends: 103 [2025-03-16 13:32:30,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-16 13:32:30,109 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:30,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 59 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-16 13:32:30,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-16 13:32:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.1326530612244898) internal successors, (111), 98 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2025-03-16 13:32:30,117 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 160 [2025-03-16 13:32:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:30,118 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2025-03-16 13:32:30,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:32:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2025-03-16 13:32:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 13:32:30,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:30,120 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:30,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:30,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-16 13:32:30,323 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:30,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:30,324 INFO L85 PathProgramCache]: Analyzing trace with hash 273450783, now seen corresponding path program 6 times [2025-03-16 13:32:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:30,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051728382] [2025-03-16 13:32:30,324 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:32:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:30,353 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 232 statements into 42 equivalence classes. [2025-03-16 13:32:30,432 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 66 of 232 statements. [2025-03-16 13:32:30,433 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-16 13:32:30,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5715 trivial. 0 not checked. [2025-03-16 13:32:30,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:30,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051728382] [2025-03-16 13:32:30,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051728382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:30,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045157109] [2025-03-16 13:32:30,598 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:32:30,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:30,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:30,601 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:30,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 13:32:30,701 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 232 statements into 42 equivalence classes. [2025-03-16 13:32:30,796 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 66 of 232 statements. [2025-03-16 13:32:30,796 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-16 13:32:30,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:30,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 13:32:30,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 2490 proven. 21 refuted. 0 times theorem prover too weak. 3225 trivial. 0 not checked. [2025-03-16 13:32:30,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:30,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5715 trivial. 0 not checked. [2025-03-16 13:32:30,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045157109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:30,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:30,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-16 13:32:30,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195487190] [2025-03-16 13:32:30,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:30,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 13:32:30,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:30,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 13:32:30,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2025-03-16 13:32:30,928 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:32:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:30,947 INFO L93 Difference]: Finished difference Result 181 states and 213 transitions. [2025-03-16 13:32:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 13:32:30,948 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 232 [2025-03-16 13:32:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:30,948 INFO L225 Difference]: With dead ends: 181 [2025-03-16 13:32:30,949 INFO L226 Difference]: Without dead ends: 111 [2025-03-16 13:32:30,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 454 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2025-03-16 13:32:30,949 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:30,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-16 13:32:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-16 13:32:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.1226415094339623) internal successors, (119), 106 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2025-03-16 13:32:30,955 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 232 [2025-03-16 13:32:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:30,956 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2025-03-16 13:32:30,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:32:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2025-03-16 13:32:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-16 13:32:30,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:30,957 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:30,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:31,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 13:32:31,158 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:31,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:31,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1855197087, now seen corresponding path program 7 times [2025-03-16 13:32:31,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:31,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608399840] [2025-03-16 13:32:31,159 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 13:32:31,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:31,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-16 13:32:31,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-16 13:32:31,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:31,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5820 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 5715 trivial. 0 not checked. [2025-03-16 13:32:31,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:31,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608399840] [2025-03-16 13:32:31,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608399840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:31,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099819387] [2025-03-16 13:32:31,742 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 13:32:31,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:31,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:31,744 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:31,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-16 13:32:31,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-16 13:32:31,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-16 13:32:31,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:31,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:31,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 13:32:31,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5820 backedges. 2490 proven. 105 refuted. 0 times theorem prover too weak. 3225 trivial. 0 not checked. [2025-03-16 13:32:31,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5820 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 5715 trivial. 0 not checked. [2025-03-16 13:32:32,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099819387] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:32,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:32,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 22 [2025-03-16 13:32:32,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026209578] [2025-03-16 13:32:32,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:32,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 13:32:32,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:32,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 13:32:32,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-03-16 13:32:32,146 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:32:32,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:32,170 INFO L93 Difference]: Finished difference Result 186 states and 215 transitions. [2025-03-16 13:32:32,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 13:32:32,172 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 240 [2025-03-16 13:32:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:32,172 INFO L225 Difference]: With dead ends: 186 [2025-03-16 13:32:32,172 INFO L226 Difference]: Without dead ends: 116 [2025-03-16 13:32:32,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 464 SyntacticMatches, 11 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-03-16 13:32:32,173 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:32,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-16 13:32:32,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-16 13:32:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.117117117117117) internal successors, (124), 111 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2025-03-16 13:32:32,183 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 240 [2025-03-16 13:32:32,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:32,184 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2025-03-16 13:32:32,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:32:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2025-03-16 13:32:32,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-16 13:32:32,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:32,185 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:32,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:32,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 13:32:32,386 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:32,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:32,386 INFO L85 PathProgramCache]: Analyzing trace with hash 820782544, now seen corresponding path program 8 times [2025-03-16 13:32:32,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:32,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60571556] [2025-03-16 13:32:32,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:32,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:32,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 245 statements into 2 equivalence classes. [2025-03-16 13:32:32,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 245 of 245 statements. [2025-03-16 13:32:32,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:32,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 13:32:32,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1680521315] [2025-03-16 13:32:32,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:32,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:32,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:32,818 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:32,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-16 13:32:32,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 245 statements into 2 equivalence classes. [2025-03-16 13:32:37,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 245 of 245 statements. [2025-03-16 13:32:37,190 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:37,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 13:32:37,190 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 13:32:37,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-16 13:32:42,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-16 13:32:42,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:42,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 13:32:42,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 13:32:42,947 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 13:32:42,948 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 13:32:42,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:43,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 13:32:43,152 INFO L422 BasicCegarLoop]: Path program histogram: [8, 3, 1, 1, 1, 1] [2025-03-16 13:32:43,234 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 13:32:43,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 01:32:43 BoogieIcfgContainer [2025-03-16 13:32:43,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 13:32:43,237 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 13:32:43,237 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 13:32:43,237 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 13:32:43,238 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:32:24" (3/4) ... [2025-03-16 13:32:43,253 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 13:32:43,344 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 177. [2025-03-16 13:32:43,430 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 13:32:43,430 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 13:32:43,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 13:32:43,431 INFO L158 Benchmark]: Toolchain (without parser) took 18977.72ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.9MB in the beginning and 163.0MB in the end (delta: -50.1MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. [2025-03-16 13:32:43,431 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 13:32:43,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.75ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 101.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 13:32:43,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.74ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.2MB in the end (delta: 991.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 13:32:43,432 INFO L158 Benchmark]: Boogie Preprocessor took 20.75ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 13:32:43,432 INFO L158 Benchmark]: IcfgBuilder took 239.62ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 85.0MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 13:32:43,433 INFO L158 Benchmark]: TraceAbstraction took 18344.90ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 84.5MB in the beginning and 72.1MB in the end (delta: 12.4MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2025-03-16 13:32:43,433 INFO L158 Benchmark]: Witness Printer took 193.34ms. Allocated memory is still 218.1MB. Free memory was 72.1MB in the beginning and 163.0MB in the end (delta: -90.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2025-03-16 13:32:43,435 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.16ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.75ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 101.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.74ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.2MB in the end (delta: 991.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.75ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 239.62ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 85.0MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18344.90ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 84.5MB in the beginning and 72.1MB in the end (delta: 12.4MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * Witness Printer took 193.34ms. Allocated memory is still 218.1MB. Free memory was 72.1MB in the beginning and 163.0MB in the end (delta: -90.9MB). Peak memory consumption was 12.3MB. 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 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[20]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=11, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=12, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=13, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=14, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=15, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=16, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=17, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=18, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=19, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=20, x={3:0}] [L17] COND FALSE !(i < 20) [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=11, ret=18, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=18, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=1, i=12, ret=18, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=12, ret=23, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=23, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=2, i=13, ret=23, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=13, ret=29, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=29, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=3, i=14, ret=29, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=14, ret=46, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=46, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=4, i=15, ret=46, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=5, i=15, ret=61, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=61, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=5, i=16, ret=61, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=6, i=16, ret=75, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=75, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=6, i=17, ret=75, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=7, i=17, ret=79, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=79, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=7, i=18, ret=79, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=8, i=18, ret=-2147483569, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=-2147483569, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=8, i=19, ret=-2147483569, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=9, i=19, ret=-2147483562, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-2147483562, x={3:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={3:0}, cnt=9, ret=-2147483562, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-238609284, x={3:0}] [L49] RET, EXPR rangesum(x) VAL [x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp [L52] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=11, ret=18, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=18, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=1, i=12, ret=18, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=12, ret=23, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=23, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=2, i=13, ret=23, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=13, ret=29, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=29, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=3, i=14, ret=29, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=14, ret=46, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=46, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=4, i=15, ret=46, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=5, i=15, ret=61, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=61, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=5, i=16, ret=61, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=6, i=16, ret=75, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=75, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=6, i=17, ret=75, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=7, i=17, ret=79, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=79, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=7, i=18, ret=79, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=8, i=18, ret=-2147483569, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=-2147483569, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=8, i=19, ret=-2147483569, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=9, i=19, ret=-2147483562, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-2147483562, x={3:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={3:0}, cnt=9, ret=-2147483562, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-238609284, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [ret=-238609284, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret2=-238609284, ret=-238609284, temp=6, x={3:0}] [L54] COND FALSE !(i<20 -1) [L57] x[20 -1] = temp [L58] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=11, ret=5, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=5, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=1, i=12, ret=5, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=12, ret=11, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=11, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=2, i=13, ret=11, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=13, ret=28, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=28, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=3, i=14, ret=28, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=14, ret=43, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=43, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=4, i=15, ret=43, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=5, i=15, ret=57, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=57, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=5, i=16, ret=57, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=6, i=16, ret=61, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=61, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=6, i=17, ret=61, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=7, i=17, ret=-2147483587, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=-2147483587, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=7, i=18, ret=-2147483587, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=8, i=18, ret=-2147483580, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=-2147483580, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=8, i=19, ret=-2147483580, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=9, i=19, ret=-2147483574, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-2147483574, x={3:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={3:0}, cnt=9, ret=-2147483574, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-238609286, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=-238609284, ret=-238609284, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={3:0}] [L61] reach_error() VAL [x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 33 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 15, TraceHistogramMax: 60, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 1094 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 771 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 281 IncrementalHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 323 mSDtfsCounter, 281 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2308 GetRequests, 2169 SyntacticMatches, 17 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=14, InterpolantAutomatonStates: 138, 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, 14 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2919 NumberOfCodeBlocks, 2014 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 3468 ConstructedInterpolants, 0 QuantifiedInterpolants, 3961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2955 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 47260/49243 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 proved your program to be incorrect! [2025-03-16 13:32:43,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE