./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/reducercommutativity/rangesum40.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 a418834dbd1069728d4982a06f4275da717a1d93e3d5061fbbc21c5c3a319ddf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:32:25,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:32:25,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 13:32:25,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:32:25,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:32:25,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:32:25,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:32:25,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:32:25,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:32:25,322 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:32:25,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:32:25,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:32:25,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:32:25,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:32:25,323 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:32:25,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:32:25,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:32:25,323 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:32:25,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:32:25,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:32:25,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:32:25,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:32:25,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:32:25,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:32:25,323 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:32:25,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:32:25,324 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:32:25,324 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:32:25,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:32:25,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:32:25,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:32:25,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:32:25,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:32:25,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:32:25,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:32:25,325 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:32:25,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:32:25,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:32:25,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:32:25,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:32:25,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:32:25,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:32:25,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:32:25,325 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 -> a418834dbd1069728d4982a06f4275da717a1d93e3d5061fbbc21c5c3a319ddf [2025-03-16 13:32:25,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:32:25,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:32:25,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:32:25,548 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:32:25,548 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:32:25,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum40.i [2025-03-16 13:32:26,658 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f07a190e/4ea8437693f747499b9cf63edad1b462/FLAG1e2303cb8 [2025-03-16 13:32:26,872 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:32:26,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum40.i [2025-03-16 13:32:26,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f07a190e/4ea8437693f747499b9cf63edad1b462/FLAG1e2303cb8 [2025-03-16 13:32:26,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f07a190e/4ea8437693f747499b9cf63edad1b462 [2025-03-16 13:32:26,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:32:26,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:32:26,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:32:26,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:32:26,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:32:26,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:32:26" (1/1) ... [2025-03-16 13:32:26,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7a3495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:26, skipping insertion in model container [2025-03-16 13:32:26,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:32:26" (1/1) ... [2025-03-16 13:32:26,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:32:27,014 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/rangesum40.i[1465,1478] [2025-03-16 13:32:27,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:32:27,024 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:32:27,039 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/rangesum40.i[1465,1478] [2025-03-16 13:32:27,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:32:27,053 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:32:27,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:27 WrapperNode [2025-03-16 13:32:27,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:32:27,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:32:27,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:32:27,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:32:27,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:27" (1/1) ... [2025-03-16 13:32:27,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:27" (1/1) ... [2025-03-16 13:32:27,080 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2025-03-16 13:32:27,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:32:27,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:32:27,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:32:27,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:32:27,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:27" (1/1) ... [2025-03-16 13:32:27,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:27" (1/1) ... [2025-03-16 13:32:27,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:27" (1/1) ... [2025-03-16 13:32:27,103 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-16 13:32:27,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:27" (1/1) ... [2025-03-16 13:32:27,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:27" (1/1) ... [2025-03-16 13:32:27,109 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:27" (1/1) ... [2025-03-16 13:32:27,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:27" (1/1) ... [2025-03-16 13:32:27,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:27" (1/1) ... [2025-03-16 13:32:27,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:27" (1/1) ... [2025-03-16 13:32:27,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:32:27,116 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:32:27,116 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:32:27,116 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:32:27,117 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:27" (1/1) ... [2025-03-16 13:32:27,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:32:27,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:27,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 13:32:27,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 13:32:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:32:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:32:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:32:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 13:32:27,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:32:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:32:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:32:27,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:32:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:32:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:32:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2025-03-16 13:32:27,161 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2025-03-16 13:32:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 13:32:27,204 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:32:27,205 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:32:27,301 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-16 13:32:27,326 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-16 13:32:27,326 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:32:27,334 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:32:27,334 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:32:27,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:32:27 BoogieIcfgContainer [2025-03-16 13:32:27,334 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:32:27,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:32:27,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:32:27,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:32:27,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:32:26" (1/3) ... [2025-03-16 13:32:27,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fb7e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:32:27, skipping insertion in model container [2025-03-16 13:32:27,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:32:27" (2/3) ... [2025-03-16 13:32:27,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fb7e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:32:27, skipping insertion in model container [2025-03-16 13:32:27,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:32:27" (3/3) ... [2025-03-16 13:32:27,341 INFO L128 eAbstractionObserver]: Analyzing ICFG rangesum40.i [2025-03-16 13:32:27,351 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:32:27,352 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rangesum40.i that has 2 procedures, 23 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-16 13:32:27,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:32:27,395 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;@10e88f9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:32:27,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:32:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:27,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 13:32:27,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:27,402 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:27,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:27,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:27,406 INFO L85 PathProgramCache]: Analyzing trace with hash 590336288, now seen corresponding path program 1 times [2025-03-16 13:32:27,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:27,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799606699] [2025-03-16 13:32:27,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:27,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:27,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 13:32:27,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 13:32:27,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:27,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 13:32:27,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:27,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799606699] [2025-03-16 13:32:27,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799606699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:27,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:32:27,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 13:32:27,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314330991] [2025-03-16 13:32:27,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:27,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:32:27,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:27,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:32:27,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 13:32:27,682 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:32:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:27,708 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2025-03-16 13:32:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:32:27,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2025-03-16 13:32:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:27,715 INFO L225 Difference]: With dead ends: 45 [2025-03-16 13:32:27,715 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 13:32:27,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 13:32:27,721 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:27,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 13:32:27,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-16 13:32:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2025-03-16 13:32:27,754 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 26 [2025-03-16 13:32:27,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:27,754 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-03-16 13:32:27,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:32:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2025-03-16 13:32:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 13:32:27,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:27,757 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:27,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 13:32:27,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:27,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:27,758 INFO L85 PathProgramCache]: Analyzing trace with hash -527850959, now seen corresponding path program 1 times [2025-03-16 13:32:27,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:27,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422911181] [2025-03-16 13:32:27,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:27,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:27,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 13:32:27,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 13:32:27,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:27,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 13:32:27,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:27,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422911181] [2025-03-16 13:32:27,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422911181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:27,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284698714] [2025-03-16 13:32:27,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:27,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:27,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:27,912 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:27,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 13:32:27,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 13:32:28,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 13:32:28,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:28,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:28,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 13:32:28,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 13:32:28,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:32:28,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284698714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:28,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:32:28,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 13:32:28,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585056896] [2025-03-16 13:32:28,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:28,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:32:28,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:28,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:32:28,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:28,035 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:28,049 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2025-03-16 13:32:28,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:32:28,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-16 13:32:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:28,051 INFO L225 Difference]: With dead ends: 39 [2025-03-16 13:32:28,051 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 13:32:28,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:28,052 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:28,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 13:32:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-16 13:32:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-16 13:32:28,059 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 27 [2025-03-16 13:32:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:28,059 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-16 13:32:28,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-03-16 13:32:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 13:32:28,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:28,060 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:28,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 13:32:28,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:28,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:28,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:28,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1092725448, now seen corresponding path program 1 times [2025-03-16 13:32:28,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:28,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476166125] [2025-03-16 13:32:28,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:28,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:28,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 13:32:28,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 13:32:28,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:28,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-16 13:32:28,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:28,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476166125] [2025-03-16 13:32:28,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476166125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:28,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798626422] [2025-03-16 13:32:28,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:28,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:28,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:28,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:28,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 13:32:28,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 13:32:28,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 13:32:28,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:28,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:28,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 13:32:28,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 13:32:28,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:32:28,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798626422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:28,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:32:28,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 13:32:28,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182942986] [2025-03-16 13:32:28,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:28,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:32:28,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:28,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:32:28,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:28,441 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:28,450 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2025-03-16 13:32:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:32:28,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-03-16 13:32:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:28,452 INFO L225 Difference]: With dead ends: 37 [2025-03-16 13:32:28,452 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 13:32:28,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:28,453 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:28,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 13:32:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-16 13:32:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2025-03-16 13:32:28,460 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 36 [2025-03-16 13:32:28,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:28,461 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-03-16 13:32:28,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2025-03-16 13:32:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 13:32:28,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:28,462 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:28,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:28,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 13:32:28,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:28,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash -144785531, now seen corresponding path program 1 times [2025-03-16 13:32:28,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:28,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218375425] [2025-03-16 13:32:28,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:28,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:28,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 13:32:28,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:32:28,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:28,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:28,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:28,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218375425] [2025-03-16 13:32:28,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218375425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:28,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775960419] [2025-03-16 13:32:28,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:28,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:28,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:28,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:28,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 13:32:28,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 13:32:28,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:32:28,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:28,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:28,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 13:32:28,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 13:32:28,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:32:28,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775960419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:28,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:32:28,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 13:32:28,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104266083] [2025-03-16 13:32:28,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:28,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:32:28,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:28,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:32:28,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:28,830 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:28,837 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2025-03-16 13:32:28,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:32:28,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-16 13:32:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:28,838 INFO L225 Difference]: With dead ends: 46 [2025-03-16 13:32:28,838 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 13:32:28,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:32:28,839 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:28,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 13:32:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 13:32:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-16 13:32:28,842 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 37 [2025-03-16 13:32:28,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:28,842 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-16 13:32:28,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:32:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-03-16 13:32:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 13:32:28,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:28,843 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:28,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 13:32:29,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:29,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:29,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:29,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1367965278, now seen corresponding path program 1 times [2025-03-16 13:32:29,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:29,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853369891] [2025-03-16 13:32:29,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:29,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:29,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 13:32:29,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:32:29,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:29,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:29,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:29,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853369891] [2025-03-16 13:32:29,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853369891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:29,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459738833] [2025-03-16 13:32:29,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:29,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:29,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:29,101 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:29,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 13:32:29,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 13:32:29,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:32:29,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:29,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:29,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 13:32:29,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:29,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:29,229 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:29,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459738833] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:29,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:29,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-16 13:32:29,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370269670] [2025-03-16 13:32:29,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:29,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 13:32:29,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:29,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 13:32:29,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:32:29,231 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 13:32:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:29,247 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2025-03-16 13:32:29,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:32:29,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 37 [2025-03-16 13:32:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:29,248 INFO L225 Difference]: With dead ends: 54 [2025-03-16 13:32:29,248 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 13:32:29,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:32:29,249 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:29,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 13:32:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-16 13:32:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-03-16 13:32:29,256 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 37 [2025-03-16 13:32:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:29,257 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-16 13:32:29,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 13:32:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-03-16 13:32:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 13:32:29,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:29,258 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:29,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:29,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:29,463 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:29,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:29,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1245446639, now seen corresponding path program 2 times [2025-03-16 13:32:29,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:29,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027195315] [2025-03-16 13:32:29,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:29,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:29,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-16 13:32:29,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 13:32:29,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:29,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 13:32:29,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:29,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027195315] [2025-03-16 13:32:29,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027195315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:29,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587109982] [2025-03-16 13:32:29,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:29,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:29,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:29,530 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:29,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 13:32:29,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-16 13:32:29,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 13:32:29,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:29,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:29,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:32:29,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:29,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 13:32:29,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587109982] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:29,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:29,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 7] total 14 [2025-03-16 13:32:29,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219043969] [2025-03-16 13:32:29,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:29,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 13:32:29,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:29,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 13:32:29,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-16 13:32:29,719 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:32:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:29,759 INFO L93 Difference]: Finished difference Result 64 states and 90 transitions. [2025-03-16 13:32:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 13:32:29,759 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 40 [2025-03-16 13:32:29,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:29,760 INFO L225 Difference]: With dead ends: 64 [2025-03-16 13:32:29,760 INFO L226 Difference]: Without dead ends: 40 [2025-03-16 13:32:29,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-16 13:32:29,760 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:29,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 114 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-16 13:32:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2025-03-16 13:32:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-03-16 13:32:29,769 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 40 [2025-03-16 13:32:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:29,770 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-03-16 13:32:29,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:32:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-03-16 13:32:29,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 13:32:29,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:29,770 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:29,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:29,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:29,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:29,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:29,971 INFO L85 PathProgramCache]: Analyzing trace with hash -364195056, now seen corresponding path program 3 times [2025-03-16 13:32:29,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:29,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252283608] [2025-03-16 13:32:29,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:32:29,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:29,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 6 equivalence classes. [2025-03-16 13:32:29,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 55 statements. [2025-03-16 13:32:29,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-16 13:32:29,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-16 13:32:30,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:30,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252283608] [2025-03-16 13:32:30,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252283608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:32:30,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:32:30,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:32:30,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76583777] [2025-03-16 13:32:30,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:32:30,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:32:30,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:30,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:32:30,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:32:30,020 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:32:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:30,039 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2025-03-16 13:32:30,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:32:30,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2025-03-16 13:32:30,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:30,040 INFO L225 Difference]: With dead ends: 68 [2025-03-16 13:32:30,040 INFO L226 Difference]: Without dead ends: 42 [2025-03-16 13:32:30,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:32:30,040 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:30,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 40 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:30,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-16 13:32:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2025-03-16 13:32:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-16 13:32:30,044 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 55 [2025-03-16 13:32:30,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:30,044 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-16 13:32:30,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:32:30,044 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-03-16 13:32:30,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 13:32:30,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:30,045 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:30,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 13:32:30,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:30,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash -236490255, now seen corresponding path program 1 times [2025-03-16 13:32:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:30,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529236694] [2025-03-16 13:32:30,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:30,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:30,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 13:32:30,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 13:32:30,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:30,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-16 13:32:30,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:30,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529236694] [2025-03-16 13:32:30,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529236694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:30,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150618307] [2025-03-16 13:32:30,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:32:30,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:30,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:30,165 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:30,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 13:32:30,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 13:32:30,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 13:32:30,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:30,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:30,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 13:32:30,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-16 13:32:30,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-16 13:32:30,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150618307] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:30,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:30,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 12, 13] total 26 [2025-03-16 13:32:30,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369333919] [2025-03-16 13:32:30,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:30,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 13:32:30,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:30,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 13:32:30,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2025-03-16 13:32:30,553 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 13:32:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:30,591 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2025-03-16 13:32:30,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-16 13:32:30,592 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 64 [2025-03-16 13:32:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:30,592 INFO L225 Difference]: With dead ends: 75 [2025-03-16 13:32:30,593 INFO L226 Difference]: Without dead ends: 50 [2025-03-16 13:32:30,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2025-03-16 13:32:30,593 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:30,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:30,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-16 13:32:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-16 13:32:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-03-16 13:32:30,599 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 64 [2025-03-16 13:32:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:30,599 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-03-16 13:32:30,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 13:32:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-03-16 13:32:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 13:32:30,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:30,600 INFO L218 NwaCegarLoop]: trace histogram [22, 9, 9, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:30,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 13:32:30,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:30,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:30,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash 584800346, now seen corresponding path program 2 times [2025-03-16 13:32:30,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:30,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730985960] [2025-03-16 13:32:30,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:30,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:30,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-16 13:32:30,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 13:32:30,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:30,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-16 13:32:31,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:31,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730985960] [2025-03-16 13:32:31,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730985960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:31,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001638856] [2025-03-16 13:32:31,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:31,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:31,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:31,369 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:31,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 13:32:31,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-16 13:32:31,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 13:32:31,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:31,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:31,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 13:32:31,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-16 13:32:31,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-16 13:32:32,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001638856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:32,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:32,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 25] total 43 [2025-03-16 13:32:32,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625379803] [2025-03-16 13:32:32,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:32,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-16 13:32:32,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:32,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-16 13:32:32,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2025-03-16 13:32:32,101 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 43 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 43 states have internal predecessors, (68), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 13:32:32,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:32,147 INFO L93 Difference]: Finished difference Result 94 states and 123 transitions. [2025-03-16 13:32:32,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-16 13:32:32,148 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 43 states have internal predecessors, (68), 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 77 [2025-03-16 13:32:32,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:32,148 INFO L225 Difference]: With dead ends: 94 [2025-03-16 13:32:32,148 INFO L226 Difference]: Without dead ends: 68 [2025-03-16 13:32:32,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 130 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2025-03-16 13:32:32,150 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:32,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-16 13:32:32,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-16 13:32:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2025-03-16 13:32:32,155 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 77 [2025-03-16 13:32:32,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:32,155 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2025-03-16 13:32:32,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 43 states have internal predecessors, (68), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 13:32:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2025-03-16 13:32:32,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 13:32:32,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:32,160 INFO L218 NwaCegarLoop]: trace histogram [40, 9, 9, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:32,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 13:32:32,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:32,360 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:32,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:32,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1812876998, now seen corresponding path program 3 times [2025-03-16 13:32:32,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:32,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275275771] [2025-03-16 13:32:32,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:32:32,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:32,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 21 equivalence classes. [2025-03-16 13:32:32,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 95 statements. [2025-03-16 13:32:32,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 13:32:32,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-03-16 13:32:32,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:32,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275275771] [2025-03-16 13:32:32,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275275771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:32,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908168188] [2025-03-16 13:32:32,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:32:32,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:32,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:32,465 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:32,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 13:32:32,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 21 equivalence classes. [2025-03-16 13:32:32,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 95 statements. [2025-03-16 13:32:32,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 13:32:32,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:32,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 13:32:32,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2025-03-16 13:32:32,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-03-16 13:32:32,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908168188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:32,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:32,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-16 13:32:32,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130621] [2025-03-16 13:32:32,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:32,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 13:32:32,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:32,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 13:32:32,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-16 13:32:32,616 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:32:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:32,628 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2025-03-16 13:32:32,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 13:32:32,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 95 [2025-03-16 13:32:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:32,630 INFO L225 Difference]: With dead ends: 91 [2025-03-16 13:32:32,630 INFO L226 Difference]: Without dead ends: 72 [2025-03-16 13:32:32,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-16 13:32:32,631 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:32,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-16 13:32:32,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-16 13:32:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2025-03-16 13:32:32,642 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 95 [2025-03-16 13:32:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:32,642 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2025-03-16 13:32:32,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:32:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2025-03-16 13:32:32,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 13:32:32,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:32,643 INFO L218 NwaCegarLoop]: trace histogram [40, 9, 9, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:32,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:32,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 13:32:32,843 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:32,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:32,844 INFO L85 PathProgramCache]: Analyzing trace with hash 306112250, now seen corresponding path program 4 times [2025-03-16 13:32:32,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:32,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804952726] [2025-03-16 13:32:32,844 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:32:32,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:32,869 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 99 statements into 2 equivalence classes. [2025-03-16 13:32:32,888 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 13:32:32,888 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:32:32,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 905 trivial. 0 not checked. [2025-03-16 13:32:32,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:32,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804952726] [2025-03-16 13:32:32,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804952726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:32,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913256433] [2025-03-16 13:32:32,995 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:32:32,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:32,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:32,997 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:32,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 13:32:33,089 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 99 statements into 2 equivalence classes. [2025-03-16 13:32:33,146 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 13:32:33,146 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:32:33,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:33,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 13:32:33,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 108 proven. 7 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2025-03-16 13:32:33,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 42 proven. 44 refuted. 0 times theorem prover too weak. 905 trivial. 0 not checked. [2025-03-16 13:32:33,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913256433] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:33,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:33,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-16 13:32:33,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018637762] [2025-03-16 13:32:33,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:33,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 13:32:33,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:33,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 13:32:33,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 13:32:33,201 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 13:32:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:33,225 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2025-03-16 13:32:33,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 13:32:33,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 99 [2025-03-16 13:32:33,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:33,226 INFO L225 Difference]: With dead ends: 113 [2025-03-16 13:32:33,226 INFO L226 Difference]: Without dead ends: 84 [2025-03-16 13:32:33,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 195 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-16 13:32:33,227 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:33,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-16 13:32:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-16 13:32:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2025-03-16 13:32:33,233 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 99 [2025-03-16 13:32:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:33,233 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2025-03-16 13:32:33,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 13:32:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2025-03-16 13:32:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 13:32:33,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:33,234 INFO L218 NwaCegarLoop]: trace histogram [40, 21, 21, 18, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:33,240 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-16 13:32:33,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:33,438 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:33,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:33,438 INFO L85 PathProgramCache]: Analyzing trace with hash 176580922, now seen corresponding path program 5 times [2025-03-16 13:32:33,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:33,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294624088] [2025-03-16 13:32:33,438 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:32:33,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:33,469 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 135 statements into 21 equivalence classes. [2025-03-16 13:32:33,492 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 37 of 135 statements. [2025-03-16 13:32:33,495 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-16 13:32:33,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1549 backedges. 28 proven. 82 refuted. 0 times theorem prover too weak. 1439 trivial. 0 not checked. [2025-03-16 13:32:33,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:33,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294624088] [2025-03-16 13:32:33,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294624088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:33,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803758862] [2025-03-16 13:32:33,529 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:32:33,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:33,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:33,532 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:33,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 13:32:33,619 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 135 statements into 21 equivalence classes. [2025-03-16 13:32:33,722 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 37 of 135 statements. [2025-03-16 13:32:33,722 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-16 13:32:33,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:33,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 13:32:33,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1549 backedges. 363 proven. 7 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2025-03-16 13:32:33,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1549 backedges. 37 proven. 131 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2025-03-16 13:32:33,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803758862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:33,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:33,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2025-03-16 13:32:33,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743953315] [2025-03-16 13:32:33,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:33,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 13:32:33,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:33,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 13:32:33,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-16 13:32:33,796 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:32:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:33,828 INFO L93 Difference]: Finished difference Result 143 states and 168 transitions. [2025-03-16 13:32:33,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 13:32:33,831 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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 135 [2025-03-16 13:32:33,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:33,833 INFO L225 Difference]: With dead ends: 143 [2025-03-16 13:32:33,833 INFO L226 Difference]: Without dead ends: 102 [2025-03-16 13:32:33,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-16 13:32:33,833 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:33,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 78 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:33,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-16 13:32:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-16 13:32:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.1134020618556701) internal successors, (108), 97 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2025-03-16 13:32:33,843 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 135 [2025-03-16 13:32:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:33,843 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2025-03-16 13:32:33,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:32:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2025-03-16 13:32:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-16 13:32:33,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:33,845 INFO L218 NwaCegarLoop]: trace histogram [40, 39, 39, 21, 18, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:33,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:34,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-16 13:32:34,050 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:34,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:34,050 INFO L85 PathProgramCache]: Analyzing trace with hash 472147834, now seen corresponding path program 6 times [2025-03-16 13:32:34,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:34,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105660501] [2025-03-16 13:32:34,051 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:32:34,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:34,076 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 189 statements into 28 equivalence classes. [2025-03-16 13:32:34,147 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 66 of 189 statements. [2025-03-16 13:32:34,148 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-16 13:32:34,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3196 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3175 trivial. 0 not checked. [2025-03-16 13:32:34,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:34,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105660501] [2025-03-16 13:32:34,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105660501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:34,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612042417] [2025-03-16 13:32:34,249 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:32:34,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:34,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:34,251 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:34,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 13:32:34,360 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 189 statements into 28 equivalence classes. [2025-03-16 13:32:34,514 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 66 of 189 statements. [2025-03-16 13:32:34,515 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-16 13:32:34,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:34,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 13:32:34,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3196 backedges. 1076 proven. 21 refuted. 0 times theorem prover too weak. 2099 trivial. 0 not checked. [2025-03-16 13:32:34,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3196 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3175 trivial. 0 not checked. [2025-03-16 13:32:34,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612042417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:34,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:34,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-16 13:32:34,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031110834] [2025-03-16 13:32:34,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:34,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 13:32:34,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:34,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 13:32:34,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-16 13:32:34,623 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:32:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:34,643 INFO L93 Difference]: Finished difference Result 159 states and 187 transitions. [2025-03-16 13:32:34,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 13:32:34,643 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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 189 [2025-03-16 13:32:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:34,644 INFO L225 Difference]: With dead ends: 159 [2025-03-16 13:32:34,644 INFO L226 Difference]: Without dead ends: 110 [2025-03-16 13:32:34,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-16 13:32:34,645 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:34,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-16 13:32:34,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-16 13:32:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.1047619047619048) internal successors, (116), 105 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2025-03-16 13:32:34,649 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 189 [2025-03-16 13:32:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:34,650 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2025-03-16 13:32:34,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:32:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2025-03-16 13:32:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-16 13:32:34,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:34,651 INFO L218 NwaCegarLoop]: trace histogram [40, 39, 39, 21, 18, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:34,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:34,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 13:32:34,852 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:34,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:34,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1447783686, now seen corresponding path program 7 times [2025-03-16 13:32:34,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:34,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542220646] [2025-03-16 13:32:34,852 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 13:32:34,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:34,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-16 13:32:34,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-16 13:32:34,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:34,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 133 proven. 1131 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-16 13:32:35,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542220646] [2025-03-16 13:32:35,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542220646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682809729] [2025-03-16 13:32:35,109 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 13:32:35,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:35,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:35,111 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:35,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-16 13:32:35,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-16 13:32:35,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-16 13:32:35,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:32:35,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:35,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 13:32:35,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 669 proven. 57 refuted. 0 times theorem prover too weak. 2554 trivial. 0 not checked. [2025-03-16 13:32:35,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 133 proven. 1131 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-16 13:32:35,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682809729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:35,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:35,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-16 13:32:35,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274935796] [2025-03-16 13:32:35,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:35,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 13:32:35,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:35,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 13:32:35,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-16 13:32:35,455 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:32:35,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:35,499 INFO L93 Difference]: Finished difference Result 201 states and 234 transitions. [2025-03-16 13:32:35,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 13:32:35,499 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 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 197 [2025-03-16 13:32:35,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:35,500 INFO L225 Difference]: With dead ends: 201 [2025-03-16 13:32:35,500 INFO L226 Difference]: Without dead ends: 134 [2025-03-16 13:32:35,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-16 13:32:35,502 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:35,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:35,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-16 13:32:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-16 13:32:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.0852713178294573) internal successors, (140), 129 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2025-03-16 13:32:35,507 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 197 [2025-03-16 13:32:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:35,507 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2025-03-16 13:32:35,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:32:35,508 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2025-03-16 13:32:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-16 13:32:35,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:35,509 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 42, 40, 21, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:35,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-16 13:32:35,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 13:32:35,710 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:35,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:35,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1890219898, now seen corresponding path program 8 times [2025-03-16 13:32:35,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:35,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078618173] [2025-03-16 13:32:35,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:35,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:35,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 269 statements into 2 equivalence classes. [2025-03-16 13:32:35,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-03-16 13:32:35,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:35,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6988 backedges. 293 proven. 3039 refuted. 0 times theorem prover too weak. 3656 trivial. 0 not checked. [2025-03-16 13:32:36,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:36,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078618173] [2025-03-16 13:32:36,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078618173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:36,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604889059] [2025-03-16 13:32:36,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:32:36,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:36,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:36,185 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:36,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-16 13:32:36,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 269 statements into 2 equivalence classes. [2025-03-16 13:32:36,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-03-16 13:32:36,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:32:36,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:36,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 13:32:36,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6988 backedges. 2173 proven. 301 refuted. 0 times theorem prover too weak. 4514 trivial. 0 not checked. [2025-03-16 13:32:36,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6988 backedges. 293 proven. 3039 refuted. 0 times theorem prover too weak. 3656 trivial. 0 not checked. [2025-03-16 13:32:36,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604889059] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:36,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:36,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 24 [2025-03-16 13:32:36,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971071333] [2025-03-16 13:32:36,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:36,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 13:32:36,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:36,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 13:32:36,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-16 13:32:36,694 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 24 states have internal predecessors, (95), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:32:36,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:36,770 INFO L93 Difference]: Finished difference Result 246 states and 278 transitions. [2025-03-16 13:32:36,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 13:32:36,771 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 24 states have internal predecessors, (95), 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 269 [2025-03-16 13:32:36,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:36,772 INFO L225 Difference]: With dead ends: 246 [2025-03-16 13:32:36,772 INFO L226 Difference]: Without dead ends: 155 [2025-03-16 13:32:36,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 522 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-16 13:32:36,773 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:36,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 155 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:32:36,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-16 13:32:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-03-16 13:32:36,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.0733333333333333) internal successors, (161), 150 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2025-03-16 13:32:36,785 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 269 [2025-03-16 13:32:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:36,785 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2025-03-16 13:32:36,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 24 states have internal predecessors, (95), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:32:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2025-03-16 13:32:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-16 13:32:36,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:36,787 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 63, 40, 21, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:36,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:36,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 13:32:36,988 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:36,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2138016769, now seen corresponding path program 9 times [2025-03-16 13:32:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:36,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399393467] [2025-03-16 13:32:36,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:32:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:37,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 332 statements into 58 equivalence classes. [2025-03-16 13:32:37,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 94 of 332 statements. [2025-03-16 13:32:37,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-16 13:32:37,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 11650 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 11545 trivial. 0 not checked. [2025-03-16 13:32:37,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:37,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399393467] [2025-03-16 13:32:37,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399393467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:37,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474687241] [2025-03-16 13:32:37,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:32:37,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:37,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:37,319 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:37,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-16 13:32:37,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 332 statements into 58 equivalence classes. [2025-03-16 13:32:38,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 94 of 332 statements. [2025-03-16 13:32:38,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-16 13:32:38,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:38,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 13:32:38,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 11650 backedges. 4826 proven. 105 refuted. 0 times theorem prover too weak. 6719 trivial. 0 not checked. [2025-03-16 13:32:38,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11650 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 11545 trivial. 0 not checked. [2025-03-16 13:32:39,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474687241] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:39,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:39,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2025-03-16 13:32:39,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170880157] [2025-03-16 13:32:39,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:39,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-16 13:32:39,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:39,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-16 13:32:39,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 13:32:39,274 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:32:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:39,310 INFO L93 Difference]: Finished difference Result 265 states and 301 transitions. [2025-03-16 13:32:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-16 13:32:39,311 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 states have internal predecessors, (57), 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 332 [2025-03-16 13:32:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:39,312 INFO L225 Difference]: With dead ends: 265 [2025-03-16 13:32:39,312 INFO L226 Difference]: Without dead ends: 171 [2025-03-16 13:32:39,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 13:32:39,313 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:39,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:32:39,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-16 13:32:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-03-16 13:32:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.0662650602409638) internal successors, (177), 166 states have internal predecessors, (177), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 183 transitions. [2025-03-16 13:32:39,320 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 183 transitions. Word has length 332 [2025-03-16 13:32:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:39,321 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 183 transitions. [2025-03-16 13:32:39,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 13:32:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 183 transitions. [2025-03-16 13:32:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-16 13:32:39,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:39,324 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 63, 40, 30, 21, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:39,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:39,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:39,528 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:39,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1179026687, now seen corresponding path program 10 times [2025-03-16 13:32:39,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:39,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335872842] [2025-03-16 13:32:39,528 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:32:39,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:39,565 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 348 statements into 2 equivalence classes. [2025-03-16 13:32:39,589 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 13:32:39,592 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:32:39,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12010 backedges. 0 proven. 5986 refuted. 0 times theorem prover too weak. 6024 trivial. 0 not checked. [2025-03-16 13:32:40,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:40,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335872842] [2025-03-16 13:32:40,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335872842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:40,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331901183] [2025-03-16 13:32:40,470 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:32:40,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:40,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:40,472 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:40,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-16 13:32:40,632 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 348 statements into 2 equivalence classes. [2025-03-16 13:32:40,727 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 13:32:40,727 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:32:40,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:40,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-16 13:32:40,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12010 backedges. 4824 proven. 1162 refuted. 0 times theorem prover too weak. 6024 trivial. 0 not checked. [2025-03-16 13:32:40,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12010 backedges. 4824 proven. 1162 refuted. 0 times theorem prover too weak. 6024 trivial. 0 not checked. [2025-03-16 13:32:41,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331901183] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:41,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:41,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 42 [2025-03-16 13:32:41,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954219515] [2025-03-16 13:32:41,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:41,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-16 13:32:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:41,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-16 13:32:41,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2025-03-16 13:32:41,449 INFO L87 Difference]: Start difference. First operand 171 states and 183 transitions. Second operand has 42 states, 42 states have (on average 3.619047619047619) internal successors, (152), 42 states have internal predecessors, (152), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 13:32:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:41,596 INFO L93 Difference]: Finished difference Result 335 states and 384 transitions. [2025-03-16 13:32:41,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-16 13:32:41,597 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.619047619047619) internal successors, (152), 42 states have internal predecessors, (152), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 348 [2025-03-16 13:32:41,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:41,599 INFO L225 Difference]: With dead ends: 335 [2025-03-16 13:32:41,599 INFO L226 Difference]: Without dead ends: 207 [2025-03-16 13:32:41,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 667 SyntacticMatches, 18 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2025-03-16 13:32:41,601 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:41,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 116 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:32:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-16 13:32:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-16 13:32:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.113861386138614) internal successors, (225), 202 states have internal predecessors, (225), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:32:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 231 transitions. [2025-03-16 13:32:41,611 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 231 transitions. Word has length 348 [2025-03-16 13:32:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:41,611 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 231 transitions. [2025-03-16 13:32:41,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.619047619047619) internal successors, (152), 42 states have internal predecessors, (152), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-16 13:32:41,612 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 231 transitions. [2025-03-16 13:32:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-16 13:32:41,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:41,614 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 63, 57, 40, 30, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:32:41,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-16 13:32:41,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 13:32:41,818 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:41,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:41,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1192788865, now seen corresponding path program 11 times [2025-03-16 13:32:41,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:41,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257065628] [2025-03-16 13:32:41,819 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:32:41,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:41,855 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 456 statements into 82 equivalence classes. [2025-03-16 13:32:42,604 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 81 check-sat command(s) and asserted 445 of 456 statements. [2025-03-16 13:32:42,604 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 81 check-sat command(s) [2025-03-16 13:32:42,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 23080 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 22615 trivial. 0 not checked. [2025-03-16 13:32:43,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:43,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257065628] [2025-03-16 13:32:43,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257065628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:43,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341333885] [2025-03-16 13:32:43,580 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:32:43,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:43,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:43,583 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:32:43,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-16 13:32:43,765 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 456 statements into 82 equivalence classes.