./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/sep60-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/sep60-2.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 b065e6ebd473a7ead2bba44643aa633e2e19aa846c3de415abaad6e73d224b64 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:22:59,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:22:59,784 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:22:59,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:22:59,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:22:59,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:22:59,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:22:59,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:22:59,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:22:59,801 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:22:59,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:22:59,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:22:59,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:22:59,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:22:59,803 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:22:59,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:22:59,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:22:59,803 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:22:59,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:22:59,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:22:59,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:22:59,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:22:59,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:22:59,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:22:59,804 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:22:59,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:22:59,804 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:22:59,804 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:22:59,804 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:22:59,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:22:59,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:22:59,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:22:59,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:22:59,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:22:59,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:22:59,805 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:22:59,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:22:59,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:22:59,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:22:59,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:22:59,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:22:59,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:22:59,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:22:59,805 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 -> b065e6ebd473a7ead2bba44643aa633e2e19aa846c3de415abaad6e73d224b64 [2025-03-08 00:23:00,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:23:00,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:23:00,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:23:00,040 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:23:00,040 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:23:00,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep60-2.i [2025-03-08 00:23:01,158 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca1fedf55/45de515045af43edb5bead6fdbe235d0/FLAG5b0e2e45d [2025-03-08 00:23:01,414 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:23:01,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep60-2.i [2025-03-08 00:23:01,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca1fedf55/45de515045af43edb5bead6fdbe235d0/FLAG5b0e2e45d [2025-03-08 00:23:01,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca1fedf55/45de515045af43edb5bead6fdbe235d0 [2025-03-08 00:23:01,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:23:01,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:23:01,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:23:01,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:23:01,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:23:01,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:23:01" (1/1) ... [2025-03-08 00:23:01,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59dd3d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01, skipping insertion in model container [2025-03-08 00:23:01,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:23:01" (1/1) ... [2025-03-08 00:23:01,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:23:01,873 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/sep60-2.i[1293,1306] [2025-03-08 00:23:01,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:23:01,885 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:23:01,900 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/sep60-2.i[1293,1306] [2025-03-08 00:23:01,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:23:01,914 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:23:01,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01 WrapperNode [2025-03-08 00:23:01,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:23:01,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:23:01,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:23:01,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:23:01,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01" (1/1) ... [2025-03-08 00:23:01,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01" (1/1) ... [2025-03-08 00:23:01,941 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2025-03-08 00:23:01,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:23:01,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:23:01,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:23:01,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:23:01,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01" (1/1) ... [2025-03-08 00:23:01,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01" (1/1) ... [2025-03-08 00:23:01,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01" (1/1) ... [2025-03-08 00:23:01,956 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-08 00:23:01,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01" (1/1) ... [2025-03-08 00:23:01,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01" (1/1) ... [2025-03-08 00:23:01,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01" (1/1) ... [2025-03-08 00:23:01,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01" (1/1) ... [2025-03-08 00:23:01,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01" (1/1) ... [2025-03-08 00:23:01,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01" (1/1) ... [2025-03-08 00:23:01,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:23:01,969 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:23:01,969 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:23:01,969 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:23:01,970 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01" (1/1) ... [2025-03-08 00:23:01,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:23:01,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:01,995 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-08 00:23:01,999 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-08 00:23:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:23:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:23:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:23:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:23:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:23:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:23:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:23:02,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:23:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:23:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:23:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:23:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2025-03-08 00:23:02,017 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2025-03-08 00:23:02,062 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:23:02,063 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:23:02,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: 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-08 00:23:02,185 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 00:23:02,187 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:23:02,192 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:23:02,192 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:23:02,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:23:02 BoogieIcfgContainer [2025-03-08 00:23:02,193 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:23:02,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:23:02,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:23:02,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:23:02,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:23:01" (1/3) ... [2025-03-08 00:23:02,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72391c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:23:02, skipping insertion in model container [2025-03-08 00:23:02,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:01" (2/3) ... [2025-03-08 00:23:02,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72391c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:23:02, skipping insertion in model container [2025-03-08 00:23:02,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:23:02" (3/3) ... [2025-03-08 00:23:02,201 INFO L128 eAbstractionObserver]: Analyzing ICFG sep60-2.i [2025-03-08 00:23:02,212 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:23:02,213 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sep60-2.i that has 2 procedures, 23 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:23:02,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:23:02,267 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;@2e896c22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:23:02,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:23:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.3529411764705883) 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-08 00:23:02,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:23:02,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:02,280 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:02,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:02,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:02,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1205606060, now seen corresponding path program 1 times [2025-03-08 00:23:02,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:02,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028482700] [2025-03-08 00:23:02,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:02,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:02,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:23:02,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:23:02,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:02,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:23:02,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:02,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028482700] [2025-03-08 00:23:02,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028482700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:23:02,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:23:02,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:23:02,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993515668] [2025-03-08 00:23:02,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:23:02,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:23:02,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:02,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:23:02,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:23:02,506 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.3529411764705883) 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) 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-08 00:23:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:02,529 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2025-03-08 00:23:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:23:02,534 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 24 [2025-03-08 00:23:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:02,537 INFO L225 Difference]: With dead ends: 44 [2025-03-08 00:23:02,537 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:23:02,539 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-08 00:23:02,543 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 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-08 00:23:02,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:23:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 00:23:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-08 00:23:02,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-08 00:23:02,565 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 24 [2025-03-08 00:23:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:02,566 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-08 00:23:02,566 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-08 00:23:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-08 00:23:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:23:02,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:02,567 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:02,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:23:02,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:02,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:02,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1323805629, now seen corresponding path program 1 times [2025-03-08 00:23:02,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:02,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529267782] [2025-03-08 00:23:02,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:02,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:23:02,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:23:02,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:02,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:23:02,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:02,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529267782] [2025-03-08 00:23:02,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529267782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:02,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487274646] [2025-03-08 00:23:02,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:02,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:02,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:02,682 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-08 00:23:02,684 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-08 00:23:02,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:23:02,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:23:02,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:02,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:02,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:23:02,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:23:02,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:23:02,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487274646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:23:02,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:23:02,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:23:02,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538629827] [2025-03-08 00:23:02,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:23:02,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:23:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:02,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:23:02,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:23:02,786 INFO L87 Difference]: Start difference. First operand 20 states and 25 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-08 00:23:02,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:02,797 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2025-03-08 00:23:02,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:23:02,799 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 25 [2025-03-08 00:23:02,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:02,800 INFO L225 Difference]: With dead ends: 38 [2025-03-08 00:23:02,800 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 00:23:02,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-08 00:23:02,800 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 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-08 00:23:02,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 00:23:02,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-08 00:23:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 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-08 00:23:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-08 00:23:02,807 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 25 [2025-03-08 00:23:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:02,808 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-08 00:23:02,808 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-08 00:23:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-03-08 00:23:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:23:02,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:02,809 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, 1] [2025-03-08 00:23:02,815 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-08 00:23:03,009 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-08 00:23:03,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:03,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:03,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1387051075, now seen corresponding path program 1 times [2025-03-08 00:23:03,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:03,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096369220] [2025-03-08 00:23:03,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:03,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:03,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:23:03,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:23:03,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:03,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 00:23:03,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:03,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096369220] [2025-03-08 00:23:03,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096369220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:03,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213421008] [2025-03-08 00:23:03,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:03,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:03,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:03,118 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-08 00:23:03,120 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-08 00:23:03,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:23:03,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:23:03,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:03,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:03,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:23:03,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:23:03,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:23:03,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213421008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:23:03,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:23:03,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:23:03,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135564304] [2025-03-08 00:23:03,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:23:03,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:23:03,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:03,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:23:03,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:23:03,234 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-08 00:23:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:03,247 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-03-08 00:23:03,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:23:03,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 34 [2025-03-08 00:23:03,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:03,248 INFO L225 Difference]: With dead ends: 34 [2025-03-08 00:23:03,248 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 00:23:03,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-08 00:23:03,249 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 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-08 00:23:03,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 00:23:03,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 00:23:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-08 00:23:03,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-03-08 00:23:03,256 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 34 [2025-03-08 00:23:03,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:03,257 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-08 00:23:03,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-08 00:23:03,257 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-03-08 00:23:03,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:23:03,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:03,258 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, 1, 1] [2025-03-08 00:23:03,264 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-08 00:23:03,458 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-08 00:23:03,459 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:03,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:03,459 INFO L85 PathProgramCache]: Analyzing trace with hash 976126766, now seen corresponding path program 1 times [2025-03-08 00:23:03,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:03,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701007988] [2025-03-08 00:23:03,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:03,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:23:03,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:23:03,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:03,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:23:03,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:03,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701007988] [2025-03-08 00:23:03,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701007988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:03,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053806418] [2025-03-08 00:23:03,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:03,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:03,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:03,535 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-08 00:23:03,537 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-08 00:23:03,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:23:03,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:23:03,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:03,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:03,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:23:03,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:23:03,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:23:03,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053806418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:03,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:03,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:23:03,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058715594] [2025-03-08 00:23:03,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:03,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:23:03,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:03,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:23:03,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:23:03,647 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-08 00:23:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:03,657 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2025-03-08 00:23:03,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:23:03,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 35 [2025-03-08 00:23:03,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:03,660 INFO L225 Difference]: With dead ends: 43 [2025-03-08 00:23:03,660 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 00:23:03,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 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-08 00:23:03,661 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:03,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 00:23:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 00:23:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 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-08 00:23:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-03-08 00:23:03,665 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 35 [2025-03-08 00:23:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:03,665 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-03-08 00:23:03,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-08 00:23:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-03-08 00:23:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:23:03,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:03,666 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:03,671 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-08 00:23:03,867 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-08 00:23:03,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:03,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:03,868 INFO L85 PathProgramCache]: Analyzing trace with hash -683656291, now seen corresponding path program 2 times [2025-03-08 00:23:03,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:03,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077242365] [2025-03-08 00:23:03,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:23:03,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:03,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 00:23:03,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:23:03,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:23:03,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 00:23:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077242365] [2025-03-08 00:23:03,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077242365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14292917] [2025-03-08 00:23:03,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:23:03,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:03,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:03,937 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-08 00:23:03,940 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-08 00:23:03,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 00:23:04,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:23:04,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:23:04,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:04,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:23:04,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:23:04,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:23:04,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14292917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:04,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:04,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-08 00:23:04,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111273892] [2025-03-08 00:23:04,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:04,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:23:04,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:04,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:23:04,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:23:04,119 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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-08 00:23:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:04,150 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2025-03-08 00:23:04,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:23:04,151 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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 38 [2025-03-08 00:23:04,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:04,152 INFO L225 Difference]: With dead ends: 54 [2025-03-08 00:23:04,152 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 00:23:04,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 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-08 00:23:04,153 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:04,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 99 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:04,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 00:23:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-03-08 00:23:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-08 00:23:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-03-08 00:23:04,159 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 38 [2025-03-08 00:23:04,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:04,159 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-03-08 00:23:04,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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-08 00:23:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-03-08 00:23:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 00:23:04,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:04,161 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:04,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:23:04,361 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-08 00:23:04,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:04,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:04,362 INFO L85 PathProgramCache]: Analyzing trace with hash -765131783, now seen corresponding path program 3 times [2025-03-08 00:23:04,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:04,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771768509] [2025-03-08 00:23:04,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:23:04,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:04,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 6 equivalence classes. [2025-03-08 00:23:04,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 53 statements. [2025-03-08 00:23:04,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:23:04,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:04,448 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-08 00:23:04,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:04,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771768509] [2025-03-08 00:23:04,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771768509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:04,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010236256] [2025-03-08 00:23:04,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:23:04,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:04,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:04,451 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-08 00:23:04,452 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-08 00:23:04,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 6 equivalence classes. [2025-03-08 00:23:04,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 53 statements. [2025-03-08 00:23:04,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:23:04,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:04,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:23:04,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:23:04,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-08 00:23:04,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010236256] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:04,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:04,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:23:04,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550806319] [2025-03-08 00:23:04,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:04,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:23:04,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:04,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:23:04,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:23:04,551 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-08 00:23:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:04,564 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2025-03-08 00:23:04,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:23:04,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 53 [2025-03-08 00:23:04,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:04,565 INFO L225 Difference]: With dead ends: 52 [2025-03-08 00:23:04,565 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 00:23:04,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 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-08 00:23:04,566 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:04,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 00:23:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 00:23:04,569 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-08 00:23:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-08 00:23:04,570 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 53 [2025-03-08 00:23:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:04,570 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-08 00:23:04,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-08 00:23:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-03-08 00:23:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 00:23:04,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:04,571 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:04,577 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-08 00:23:04,775 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-08 00:23:04,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:04,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:04,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1093705932, now seen corresponding path program 4 times [2025-03-08 00:23:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:04,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198940907] [2025-03-08 00:23:04,776 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:23:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:04,794 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-08 00:23:04,818 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:23:04,820 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:23:04,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-08 00:23:04,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:04,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198940907] [2025-03-08 00:23:04,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198940907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:04,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390909588] [2025-03-08 00:23:04,902 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:23:04,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:04,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:04,904 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-08 00:23:04,906 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-08 00:23:04,955 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-08 00:23:04,988 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:23:04,988 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:23:04,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:04,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:23:04,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-08 00:23:05,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-08 00:23:05,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390909588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:05,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:05,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 00:23:05,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865194403] [2025-03-08 00:23:05,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:05,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:23:05,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:05,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:23:05,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:23:05,041 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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-08 00:23:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:05,074 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2025-03-08 00:23:05,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:23:05,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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 56 [2025-03-08 00:23:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:05,076 INFO L225 Difference]: With dead ends: 72 [2025-03-08 00:23:05,076 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 00:23:05,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:23:05,077 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:05,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 86 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 00:23:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-08 00:23:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 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-08 00:23:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2025-03-08 00:23:05,083 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 56 [2025-03-08 00:23:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:05,083 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2025-03-08 00:23:05,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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-08 00:23:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2025-03-08 00:23:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 00:23:05,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:05,084 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 10, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:05,090 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-08 00:23:05,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:05,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:05,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:05,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1991280972, now seen corresponding path program 5 times [2025-03-08 00:23:05,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:05,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129489495] [2025-03-08 00:23:05,286 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:23:05,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:05,309 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 92 statements into 14 equivalence classes. [2025-03-08 00:23:05,442 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 81 of 92 statements. [2025-03-08 00:23:05,442 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-08 00:23:05,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 123 proven. 174 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-03-08 00:23:05,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:05,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129489495] [2025-03-08 00:23:05,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129489495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:05,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950999654] [2025-03-08 00:23:05,636 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:23:05,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:05,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:05,639 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-08 00:23:05,641 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-08 00:23:05,705 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 92 statements into 14 equivalence classes. [2025-03-08 00:23:06,050 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 81 of 92 statements. [2025-03-08 00:23:06,050 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-08 00:23:06,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:06,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:23:06,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 244 proven. 51 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-08 00:23:06,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-03-08 00:23:06,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950999654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:06,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:06,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-08 00:23:06,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140030052] [2025-03-08 00:23:06,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:06,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:23:06,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:06,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:23:06,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:23:06,198 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:23:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:06,247 INFO L93 Difference]: Finished difference Result 108 states and 145 transitions. [2025-03-08 00:23:06,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:23:06,247 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 92 [2025-03-08 00:23:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:06,251 INFO L225 Difference]: With dead ends: 108 [2025-03-08 00:23:06,252 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 00:23:06,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:23:06,253 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:06,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 138 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:06,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 00:23:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-08 00:23:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 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-08 00:23:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2025-03-08 00:23:06,260 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 92 [2025-03-08 00:23:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:06,260 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-03-08 00:23:06,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:23:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2025-03-08 00:23:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 00:23:06,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:06,264 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 10, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:06,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:23:06,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:06,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:06,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:06,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2002478516, now seen corresponding path program 6 times [2025-03-08 00:23:06,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:06,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325859625] [2025-03-08 00:23:06,465 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:23:06,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:06,488 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 164 statements into 30 equivalence classes. [2025-03-08 00:23:06,525 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 52 of 164 statements. [2025-03-08 00:23:06,525 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:23:06,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:23:06,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:06,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325859625] [2025-03-08 00:23:06,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325859625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:06,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858807839] [2025-03-08 00:23:06,638 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:23:06,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:06,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:06,640 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-08 00:23:06,642 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-08 00:23:06,716 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 164 statements into 30 equivalence classes. [2025-03-08 00:23:06,799 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 52 of 164 statements. [2025-03-08 00:23:06,799 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:23:06,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:06,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:23:06,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 1240 proven. 10 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked. [2025-03-08 00:23:06,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:23:06,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858807839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:06,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:06,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-08 00:23:06,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529169322] [2025-03-08 00:23:06,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:06,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:23:06,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:06,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:23:06,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:23:06,898 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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-08 00:23:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:06,921 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2025-03-08 00:23:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:23:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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 164 [2025-03-08 00:23:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:06,922 INFO L225 Difference]: With dead ends: 130 [2025-03-08 00:23:06,922 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 00:23:06,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:23:06,923 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:06,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 00:23:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-08 00:23:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 74 states have internal predecessors, (91), 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-08 00:23:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2025-03-08 00:23:06,943 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 164 [2025-03-08 00:23:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:06,943 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2025-03-08 00:23:06,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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-08 00:23:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2025-03-08 00:23:06,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 00:23:06,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:06,948 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:06,956 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-08 00:23:07,148 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,SelfDestructingSolverStorable8 [2025-03-08 00:23:07,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:07,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:07,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1748710612, now seen corresponding path program 7 times [2025-03-08 00:23:07,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:07,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684787792] [2025-03-08 00:23:07,149 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:23:07,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:07,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 00:23:07,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 00:23:07,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:07,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:23:07,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:07,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684787792] [2025-03-08 00:23:07,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684787792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:07,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659327382] [2025-03-08 00:23:07,603 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:23:07,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:07,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:07,605 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-08 00:23:07,606 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-08 00:23:07,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 00:23:07,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 00:23:07,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:07,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:07,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:23:07,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:23:07,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:23:07,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659327382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:07,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:07,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-08 00:23:07,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838306642] [2025-03-08 00:23:07,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:07,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:23:07,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:07,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:23:07,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:23:07,981 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 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-08 00:23:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:08,002 INFO L93 Difference]: Finished difference Result 157 states and 204 transitions. [2025-03-08 00:23:08,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:23:08,003 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 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 170 [2025-03-08 00:23:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:08,003 INFO L225 Difference]: With dead ends: 157 [2025-03-08 00:23:08,004 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 00:23:08,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:23:08,005 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:08,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:08,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 00:23:08,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 00:23:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.197674418604651) internal successors, (103), 86 states have internal predecessors, (103), 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-08 00:23:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2025-03-08 00:23:08,010 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 170 [2025-03-08 00:23:08,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:08,010 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2025-03-08 00:23:08,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 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-08 00:23:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2025-03-08 00:23:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 00:23:08,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:08,011 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 22, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:08,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 00:23:08,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:23:08,212 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:08,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:08,213 INFO L85 PathProgramCache]: Analyzing trace with hash -3379220, now seen corresponding path program 8 times [2025-03-08 00:23:08,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:08,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222170464] [2025-03-08 00:23:08,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:23:08,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:08,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 182 statements into 2 equivalence classes. [2025-03-08 00:23:08,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 00:23:08,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:23:08,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3029 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:23:09,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:09,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222170464] [2025-03-08 00:23:09,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222170464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:09,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976927015] [2025-03-08 00:23:09,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:23:09,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:09,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:09,119 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-08 00:23:09,120 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-08 00:23:09,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 182 statements into 2 equivalence classes. [2025-03-08 00:23:09,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 00:23:09,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:23:09,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:09,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 00:23:09,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3029 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:23:09,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3029 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:23:09,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976927015] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:09,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:09,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-03-08 00:23:09,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599981800] [2025-03-08 00:23:09,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:09,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 00:23:09,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:09,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 00:23:09,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 00:23:09,957 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 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-08 00:23:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:10,002 INFO L93 Difference]: Finished difference Result 181 states and 240 transitions. [2025-03-08 00:23:10,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-08 00:23:10,003 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 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 182 [2025-03-08 00:23:10,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:10,005 INFO L225 Difference]: With dead ends: 181 [2025-03-08 00:23:10,005 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 00:23:10,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 00:23:10,008 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:10,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:10,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 00:23:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-08 00:23:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.1545454545454545) internal successors, (127), 110 states have internal predecessors, (127), 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-08 00:23:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2025-03-08 00:23:10,019 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 182 [2025-03-08 00:23:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:10,019 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2025-03-08 00:23:10,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 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-08 00:23:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2025-03-08 00:23:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 00:23:10,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:10,021 INFO L218 NwaCegarLoop]: trace histogram [46, 42, 42, 42, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:10,029 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-08 00:23:10,226 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,SelfDestructingSolverStorable10 [2025-03-08 00:23:10,226 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:10,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:10,226 INFO L85 PathProgramCache]: Analyzing trace with hash 5790060, now seen corresponding path program 9 times [2025-03-08 00:23:10,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:10,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512437809] [2025-03-08 00:23:10,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:23:10,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:10,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 206 statements into 30 equivalence classes. [2025-03-08 00:23:10,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 73 of 206 statements. [2025-03-08 00:23:10,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:23:10,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3857 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3802 trivial. 0 not checked. [2025-03-08 00:23:10,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512437809] [2025-03-08 00:23:10,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512437809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415283368] [2025-03-08 00:23:10,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:23:10,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:10,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:10,567 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-08 00:23:10,569 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-08 00:23:10,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 206 statements into 30 equivalence classes. [2025-03-08 00:23:10,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 73 of 206 statements. [2025-03-08 00:23:10,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:23:10,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:10,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 00:23:10,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3857 backedges. 1286 proven. 55 refuted. 0 times theorem prover too weak. 2516 trivial. 0 not checked. [2025-03-08 00:23:10,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3857 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3802 trivial. 0 not checked. [2025-03-08 00:23:11,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415283368] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:11,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:11,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 27 [2025-03-08 00:23:11,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130973496] [2025-03-08 00:23:11,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:11,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 00:23:11,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:11,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 00:23:11,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=376, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:23:11,122 INFO L87 Difference]: Start difference. First operand 115 states and 133 transitions. Second operand has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 states have internal predecessors, (50), 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-08 00:23:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:11,154 INFO L93 Difference]: Finished difference Result 178 states and 222 transitions. [2025-03-08 00:23:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 00:23:11,155 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 states have internal predecessors, (50), 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 206 [2025-03-08 00:23:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:11,155 INFO L225 Difference]: With dead ends: 178 [2025-03-08 00:23:11,155 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 00:23:11,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=326, Invalid=376, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:23:11,156 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:11,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:11,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 00:23:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-08 00:23:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.139344262295082) internal successors, (139), 122 states have internal predecessors, (139), 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-08 00:23:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2025-03-08 00:23:11,167 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 206 [2025-03-08 00:23:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:11,167 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2025-03-08 00:23:11,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 states have internal predecessors, (50), 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-08 00:23:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2025-03-08 00:23:11,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 00:23:11,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:11,169 INFO L218 NwaCegarLoop]: trace histogram [46, 42, 42, 42, 22, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:11,176 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-08 00:23:11,369 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,SelfDestructingSolverStorable11 [2025-03-08 00:23:11,369 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:11,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:11,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1491264300, now seen corresponding path program 10 times [2025-03-08 00:23:11,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:11,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947765462] [2025-03-08 00:23:11,370 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:23:11,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:11,411 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 218 statements into 2 equivalence classes. [2025-03-08 00:23:11,582 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 00:23:11,582 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:23:11,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2025-03-08 00:23:12,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:12,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947765462] [2025-03-08 00:23:12,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947765462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:12,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185494218] [2025-03-08 00:23:12,046 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:23:12,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:12,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:12,049 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-08 00:23:12,050 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-08 00:23:12,196 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 218 statements into 2 equivalence classes. [2025-03-08 00:23:12,303 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 00:23:12,303 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:23:12,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:12,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:23:12,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 1236 proven. 287 refuted. 0 times theorem prover too weak. 2532 trivial. 0 not checked. [2025-03-08 00:23:12,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2025-03-08 00:23:12,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185494218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:12,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:12,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2025-03-08 00:23:12,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421536598] [2025-03-08 00:23:12,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:12,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 00:23:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:12,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 00:23:12,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:23:12,673 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 states have internal predecessors, (111), 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-08 00:23:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:12,750 INFO L93 Difference]: Finished difference Result 252 states and 321 transitions. [2025-03-08 00:23:12,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 00:23:12,752 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 states have internal predecessors, (111), 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 218 [2025-03-08 00:23:12,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:12,753 INFO L225 Difference]: With dead ends: 252 [2025-03-08 00:23:12,753 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 00:23:12,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:23:12,753 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 89 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:12,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 188 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:23:12,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 00:23:12,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-08 00:23:12,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.1941176470588235) internal successors, (203), 170 states have internal predecessors, (203), 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-08 00:23:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 209 transitions. [2025-03-08 00:23:12,770 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 209 transitions. Word has length 218 [2025-03-08 00:23:12,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:12,770 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 209 transitions. [2025-03-08 00:23:12,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 states have internal predecessors, (111), 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-08 00:23:12,770 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 209 transitions. [2025-03-08 00:23:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-08 00:23:12,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:12,773 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 46, 22, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:12,781 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-08 00:23:12,974 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,SelfDestructingSolverStorable12 [2025-03-08 00:23:12,974 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:12,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:12,974 INFO L85 PathProgramCache]: Analyzing trace with hash 401818924, now seen corresponding path program 11 times [2025-03-08 00:23:12,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:12,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342118811] [2025-03-08 00:23:12,975 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:23:12,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:13,026 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 362 statements into 62 equivalence classes. [2025-03-08 00:23:14,483 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) and asserted 351 of 362 statements. [2025-03-08 00:23:14,484 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2025-03-08 00:23:14,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 13631 backedges. 2763 proven. 4098 refuted. 0 times theorem prover too weak. 6770 trivial. 0 not checked. [2025-03-08 00:23:15,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:15,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342118811] [2025-03-08 00:23:15,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342118811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:15,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250333588] [2025-03-08 00:23:15,863 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:23:15,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:15,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:15,866 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-08 00:23:15,867 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-08 00:23:16,035 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 362 statements into 62 equivalence classes.