./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/sep.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/sep.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 54d2da4a9e5a645ffa7361038eff25cc32e29a265e0324de9bda9a6d773becac --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:32:35,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:32:35,533 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:35,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:32:35,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:32:35,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:32:35,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:32:35,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:32:35,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:32:35,559 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:32:35,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:32:35,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:32:35,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:32:35,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:32:35,560 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:32:35,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:32:35,561 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:32:35,561 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:32:35,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:32:35,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:32:35,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:32:35,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:32:35,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:32:35,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:32:35,561 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:32:35,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:32:35,562 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:32:35,562 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:32:35,562 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:32:35,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:32:35,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:32:35,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:32:35,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:32:35,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:32:35,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:32:35,563 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:32:35,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:32:35,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:32:35,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:32:35,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:32:35,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:32:35,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:32:35,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:32:35,563 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 -> 54d2da4a9e5a645ffa7361038eff25cc32e29a265e0324de9bda9a6d773becac [2025-03-16 13:32:35,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:32:35,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:32:35,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:32:35,799 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:32:35,799 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:32:35,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep.i [2025-03-16 13:32:36,916 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d62ae211/5f51936cbae740fbb9153d569394aec1/FLAG64b63d28d [2025-03-16 13:32:37,165 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:32:37,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i [2025-03-16 13:32:37,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d62ae211/5f51936cbae740fbb9153d569394aec1/FLAG64b63d28d [2025-03-16 13:32:37,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d62ae211/5f51936cbae740fbb9153d569394aec1 [2025-03-16 13:32:37,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:32:37,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:32:37,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:32:37,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:32:37,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:32:37,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:32:37" (1/1) ... [2025-03-16 13:32:37,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5597776f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:37, skipping insertion in model container [2025-03-16 13:32:37,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:32:37" (1/1) ... [2025-03-16 13:32:37,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:32:37,626 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/sep.i[1298,1311] [2025-03-16 13:32:37,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:32:37,635 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:32:37,652 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/sep.i[1298,1311] [2025-03-16 13:32:37,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:32:37,667 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:32:37,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:37 WrapperNode [2025-03-16 13:32:37,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:32:37,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:32:37,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:32:37,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:32:37,673 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:37" (1/1) ... [2025-03-16 13:32:37,679 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:37" (1/1) ... [2025-03-16 13:32:37,693 INFO L138 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2025-03-16 13:32:37,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:32:37,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:32:37,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:32:37,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:32:37,701 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:37" (1/1) ... [2025-03-16 13:32:37,701 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:37" (1/1) ... [2025-03-16 13:32:37,703 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:37" (1/1) ... [2025-03-16 13:32:37,715 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 6, 9]. 53 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 4 writes are split as follows [0, 0, 4]. [2025-03-16 13:32:37,715 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:37" (1/1) ... [2025-03-16 13:32:37,715 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:37" (1/1) ... [2025-03-16 13:32:37,718 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:37" (1/1) ... [2025-03-16 13:32:37,719 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:37" (1/1) ... [2025-03-16 13:32:37,720 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:37" (1/1) ... [2025-03-16 13:32:37,720 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:37" (1/1) ... [2025-03-16 13:32:37,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:32:37,722 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:32:37,722 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:32:37,722 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:32:37,723 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:37" (1/1) ... [2025-03-16 13:32:37,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:32:37,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:37,747 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:37,753 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:37,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:32:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:32:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:32:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 13:32:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 13:32:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:32:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:32:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 13:32:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:32:37,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:32:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:32:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:32:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 13:32:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 13:32:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2025-03-16 13:32:37,770 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2025-03-16 13:32:37,824 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:32:37,825 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:32:37,936 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-16 13:32:37,936 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:32:37,943 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:32:37,943 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:32:37,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:32:37 BoogieIcfgContainer [2025-03-16 13:32:37,943 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:32:37,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:32:37,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:32:37,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:32:37,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:32:37" (1/3) ... [2025-03-16 13:32:37,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b8bc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:32:37, skipping insertion in model container [2025-03-16 13:32:37,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:37" (2/3) ... [2025-03-16 13:32:37,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b8bc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:32:37, skipping insertion in model container [2025-03-16 13:32:37,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:32:37" (3/3) ... [2025-03-16 13:32:37,950 INFO L128 eAbstractionObserver]: Analyzing ICFG sep.i [2025-03-16 13:32:37,960 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:32:37,961 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sep.i that has 2 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 13:32:37,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:32:38,001 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;@4f63d92c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:32:38,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:32:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.375) 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:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 13:32:38,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:38,008 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:38,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:38,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:38,013 INFO L85 PathProgramCache]: Analyzing trace with hash -530142246, now seen corresponding path program 1 times [2025-03-16 13:32:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:38,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943049265] [2025-03-16 13:32:38,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:38,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:38,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 13:32:38,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 13:32:38,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:38,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:38,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 13:32:38,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:38,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943049265] [2025-03-16 13:32:38,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943049265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:38,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518099341] [2025-03-16 13:32:38,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:38,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:38,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:38,304 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:38,306 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:38,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 13:32:38,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 13:32:38,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:38,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:38,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 13:32:38,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 13:32:38,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:32:38,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518099341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:38,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:32:38,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-03-16 13:32:38,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544509336] [2025-03-16 13:32:38,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:38,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:32:38,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:38,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:32:38,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 13:32:38,470 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.375) 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) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:38,514 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2025-03-16 13:32:38,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:32:38,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 23 [2025-03-16 13:32:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:38,519 INFO L225 Difference]: With dead ends: 47 [2025-03-16 13:32:38,520 INFO L226 Difference]: Without dead ends: 21 [2025-03-16 13:32:38,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 13:32:38,523 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:38,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 40 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:38,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-16 13:32:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-16 13:32:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-16 13:32:38,550 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 23 [2025-03-16 13:32:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:38,551 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-16 13:32:38,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-16 13:32:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 13:32:38,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:38,553 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:38,559 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:38,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 13:32:38,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:38,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:38,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1141271037, now seen corresponding path program 1 times [2025-03-16 13:32:38,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:38,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288629365] [2025-03-16 13:32:38,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:38,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:38,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 13:32:38,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 13:32:38,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:38,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 13:32:38,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:38,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288629365] [2025-03-16 13:32:38,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288629365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:38,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:32:38,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:32:38,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477796682] [2025-03-16 13:32:38,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:38,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:32:38,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:38,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:32:38,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:32:38,906 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:38,931 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-16 13:32:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:32:38,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-03-16 13:32:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:38,932 INFO L225 Difference]: With dead ends: 32 [2025-03-16 13:32:38,932 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 13:32:38,933 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:38,933 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:38,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 13:32:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-16 13:32:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-16 13:32:38,937 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 32 [2025-03-16 13:32:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:38,938 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-16 13:32:38,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-16 13:32:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 13:32:38,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:38,940 INFO L218 NwaCegarLoop]: trace histogram [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:38,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 13:32:38,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:38,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:38,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2121213460, now seen corresponding path program 1 times [2025-03-16 13:32:38,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:38,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470237669] [2025-03-16 13:32:38,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:38,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:38,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 13:32:38,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 13:32:38,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:38,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 13:32:39,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:39,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470237669] [2025-03-16 13:32:39,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470237669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:39,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114719770] [2025-03-16 13:32:39,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:39,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:39,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:39,072 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:39,073 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:39,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 13:32:39,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 13:32:39,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:39,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:39,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 13:32:39,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 13:32:39,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 13:32:39,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114719770] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:39,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:39,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-03-16 13:32:39,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583070393] [2025-03-16 13:32:39,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:39,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 13:32:39,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:39,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 13:32:39,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-16 13:32:39,286 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 13:32:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:39,335 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2025-03-16 13:32:39,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:32:39,336 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 33 [2025-03-16 13:32:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:39,336 INFO L225 Difference]: With dead ends: 42 [2025-03-16 13:32:39,336 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 13:32:39,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-16 13:32:39,337 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:39,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 38 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 13:32:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-03-16 13:32:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-16 13:32:39,341 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 33 [2025-03-16 13:32:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:39,341 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-16 13:32:39,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 13:32:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-03-16 13:32:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 13:32:39,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:39,342 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:39,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 13:32:39,542 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:39,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:39,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:39,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1469384299, now seen corresponding path program 2 times [2025-03-16 13:32:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:39,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623371140] [2025-03-16 13:32:39,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:39,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:39,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-16 13:32:39,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 13:32:39,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:39,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 45 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 13:32:40,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:40,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623371140] [2025-03-16 13:32:40,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623371140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:40,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317188125] [2025-03-16 13:32:40,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:40,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:40,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:40,478 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:40,480 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:40,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-16 13:32:40,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 13:32:40,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:40,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:40,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-16 13:32:40,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 13:32:40,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 13:32:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317188125] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:40,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:40,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 20 [2025-03-16 13:32:40,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444927674] [2025-03-16 13:32:40,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:40,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 13:32:40,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:40,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 13:32:40,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-03-16 13:32:40,907 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 15 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 13:32:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:41,048 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2025-03-16 13:32:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 13:32:41,048 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 15 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2025-03-16 13:32:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:41,050 INFO L225 Difference]: With dead ends: 54 [2025-03-16 13:32:41,050 INFO L226 Difference]: Without dead ends: 50 [2025-03-16 13:32:41,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-03-16 13:32:41,051 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:41,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 292 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:32:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-16 13:32:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2025-03-16 13:32:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-16 13:32:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2025-03-16 13:32:41,065 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 42 [2025-03-16 13:32:41,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:41,065 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2025-03-16 13:32:41,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 15 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 13:32:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2025-03-16 13:32:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 13:32:41,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:41,066 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:41,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:41,267 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:41,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:41,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:41,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1082772662, now seen corresponding path program 1 times [2025-03-16 13:32:41,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:41,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43046469] [2025-03-16 13:32:41,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:41,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 13:32:41,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 13:32:41,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:41,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 59 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 13:32:42,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:42,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43046469] [2025-03-16 13:32:42,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43046469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:42,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603989711] [2025-03-16 13:32:42,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:42,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:42,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:42,227 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:42,229 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:42,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 13:32:42,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 13:32:42,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:42,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:42,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-16 13:32:42,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:42,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-16 13:32:42,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-16 13:32:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 67 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:32:50,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:51,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-16 13:32:51,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-16 13:32:51,220 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2025-03-16 13:32:51,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2025-03-16 13:32:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 13:32:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603989711] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:51,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:51,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 45 [2025-03-16 13:32:51,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186515151] [2025-03-16 13:32:51,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:51,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-16 13:32:51,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:51,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-16 13:32:51,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1726, Unknown=2, NotChecked=0, Total=1980 [2025-03-16 13:32:51,389 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 45 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 42 states have internal predecessors, (91), 6 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-16 13:32:53,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:32:57,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:33:02,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:33:06,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:33:10,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:33:14,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:33:18,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:33:26,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:33:30,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:33:42,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:33:46,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:33:50,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:33:54,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:33:58,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]