./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_iter.c --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/verifythis/prefixsum_iter.c -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 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:30:00,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:30:01,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:30:01,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:30:01,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:30:01,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:30:01,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:30:01,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:30:01,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:30:01,050 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:30:01,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:30:01,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:30:01,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:30:01,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:30:01,052 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:30:01,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:30:01,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:30:01,052 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:30:01,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:30:01,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:30:01,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:30:01,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:30:01,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:30:01,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:30:01,053 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:30:01,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:30:01,053 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:30:01,053 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:30:01,053 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:30:01,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:30:01,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:30:01,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:30:01,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:30:01,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:30:01,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:30:01,054 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:30:01,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:30:01,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:30:01,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:30:01,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:30:01,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:30:01,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:30:01,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:30:01,055 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 -> 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d [2025-03-16 18:30:01,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:30:01,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:30:01,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:30:01,287 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:30:01,288 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:30:01,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_iter.c [2025-03-16 18:30:02,458 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee15581d6/e33d6cbcf98542b0b1da655d546d7ec7/FLAG4678261a7 [2025-03-16 18:30:02,722 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:30:02,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c [2025-03-16 18:30:02,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee15581d6/e33d6cbcf98542b0b1da655d546d7ec7/FLAG4678261a7 [2025-03-16 18:30:03,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee15581d6/e33d6cbcf98542b0b1da655d546d7ec7 [2025-03-16 18:30:03,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:30:03,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:30:03,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:30:03,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:30:03,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:30:03,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:30:03" (1/1) ... [2025-03-16 18:30:03,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cdfd7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03, skipping insertion in model container [2025-03-16 18:30:03,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:30:03" (1/1) ... [2025-03-16 18:30:03,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:30:03,134 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/verifythis/prefixsum_iter.c[526,539] [2025-03-16 18:30:03,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:30:03,161 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:30:03,169 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/verifythis/prefixsum_iter.c[526,539] [2025-03-16 18:30:03,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:30:03,187 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:30:03,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03 WrapperNode [2025-03-16 18:30:03,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:30:03,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:30:03,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:30:03,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:30:03,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03" (1/1) ... [2025-03-16 18:30:03,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03" (1/1) ... [2025-03-16 18:30:03,220 INFO L138 Inliner]: procedures = 22, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 109 [2025-03-16 18:30:03,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:30:03,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:30:03,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:30:03,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:30:03,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03" (1/1) ... [2025-03-16 18:30:03,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03" (1/1) ... [2025-03-16 18:30:03,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03" (1/1) ... [2025-03-16 18:30:03,238 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-03-16 18:30:03,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03" (1/1) ... [2025-03-16 18:30:03,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03" (1/1) ... [2025-03-16 18:30:03,247 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03" (1/1) ... [2025-03-16 18:30:03,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03" (1/1) ... [2025-03-16 18:30:03,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03" (1/1) ... [2025-03-16 18:30:03,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03" (1/1) ... [2025-03-16 18:30:03,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:30:03,255 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:30:03,255 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:30:03,255 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:30:03,256 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03" (1/1) ... [2025-03-16 18:30:03,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:30:03,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:03,283 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 18:30:03,288 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 18:30:03,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:30:03,304 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 18:30:03,305 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 18:30:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:30:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:30:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 18:30:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 18:30:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 18:30:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:30:03,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:30:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 18:30:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 18:30:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-16 18:30:03,305 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-16 18:30:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 18:30:03,380 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:30:03,381 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:30:03,547 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-16 18:30:03,547 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:30:03,553 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:30:03,553 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:30:03,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:30:03 BoogieIcfgContainer [2025-03-16 18:30:03,554 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:30:03,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:30:03,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:30:03,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:30:03,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:30:03" (1/3) ... [2025-03-16 18:30:03,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0ab8ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:30:03, skipping insertion in model container [2025-03-16 18:30:03,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:30:03" (2/3) ... [2025-03-16 18:30:03,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0ab8ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:30:03, skipping insertion in model container [2025-03-16 18:30:03,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:30:03" (3/3) ... [2025-03-16 18:30:03,562 INFO L128 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2025-03-16 18:30:03,573 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:30:03,574 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prefixsum_iter.c that has 3 procedures, 29 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-16 18:30:03,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:30:03,614 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;@72079879, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:30:03,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:30:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 18:30:03,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:03,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:03,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:03,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:03,628 INFO L85 PathProgramCache]: Analyzing trace with hash -707789835, now seen corresponding path program 1 times [2025-03-16 18:30:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:03,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140882273] [2025-03-16 18:30:03,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:03,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:03,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 18:30:03,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 18:30:03,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:03,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 18:30:03,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:03,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140882273] [2025-03-16 18:30:03,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140882273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:30:03,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971835541] [2025-03-16 18:30:03,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:03,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:03,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:03,786 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 18:30:03,787 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 18:30:03,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 18:30:03,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 18:30:03,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:03,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:03,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 18:30:03,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:30:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 18:30:03,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:30:03,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971835541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:30:03,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:30:03,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 18:30:03,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110202111] [2025-03-16 18:30:03,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:30:03,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 18:30:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:03,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 18:30:03,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 18:30:03,948 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 18:30:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:03,959 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2025-03-16 18:30:03,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 18:30:03,961 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2025-03-16 18:30:03,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:03,965 INFO L225 Difference]: With dead ends: 56 [2025-03-16 18:30:03,965 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 18:30:03,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 18:30:03,969 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:03,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:30:03,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 18:30:03,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 18:30:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-16 18:30:03,996 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 30 [2025-03-16 18:30:03,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:03,996 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-16 18:30:03,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 18:30:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-03-16 18:30:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 18:30:03,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:03,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:04,004 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 18:30:04,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 18:30:04,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:04,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:04,203 INFO L85 PathProgramCache]: Analyzing trace with hash -155000043, now seen corresponding path program 1 times [2025-03-16 18:30:04,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:04,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779527701] [2025-03-16 18:30:04,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:04,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:04,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 18:30:04,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 18:30:04,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:04,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 18:30:04,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:04,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779527701] [2025-03-16 18:30:04,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779527701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:30:04,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:30:04,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:30:04,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246647221] [2025-03-16 18:30:04,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:30:04,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:30:04,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:04,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:30:04,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:30:04,572 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:04,617 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2025-03-16 18:30:04,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:30:04,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2025-03-16 18:30:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:04,618 INFO L225 Difference]: With dead ends: 39 [2025-03-16 18:30:04,618 INFO L226 Difference]: Without dead ends: 29 [2025-03-16 18:30:04,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:30:04,619 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:04,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:30:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-16 18:30:04,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-03-16 18:30:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-03-16 18:30:04,625 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 30 [2025-03-16 18:30:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:04,626 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-03-16 18:30:04,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:04,627 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-03-16 18:30:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 18:30:04,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:04,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:04,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:30:04,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:04,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:04,629 INFO L85 PathProgramCache]: Analyzing trace with hash 495712079, now seen corresponding path program 1 times [2025-03-16 18:30:04,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:04,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184923456] [2025-03-16 18:30:04,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:04,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:04,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 18:30:04,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 18:30:04,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:04,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 18:30:05,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:05,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184923456] [2025-03-16 18:30:05,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184923456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:30:05,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791667327] [2025-03-16 18:30:05,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:05,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:05,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:05,156 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 18:30:05,162 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 18:30:05,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 18:30:05,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 18:30:05,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:05,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:05,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-16 18:30:05,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:30:05,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 18:30:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 18:30:05,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:30:05,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-16 18:30:05,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-16 18:30:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 18:30:05,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791667327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:30:05,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:30:05,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2025-03-16 18:30:05,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721238457] [2025-03-16 18:30:05,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:30:05,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 18:30:05,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:05,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 18:30:05,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-16 18:30:05,468 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 18:30:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:05,625 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2025-03-16 18:30:05,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 18:30:05,626 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2025-03-16 18:30:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:05,627 INFO L225 Difference]: With dead ends: 41 [2025-03-16 18:30:05,627 INFO L226 Difference]: Without dead ends: 39 [2025-03-16 18:30:05,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-03-16 18:30:05,628 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:05,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 306 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:30:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-16 18:30:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-03-16 18:30:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2025-03-16 18:30:05,636 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 31 [2025-03-16 18:30:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:05,636 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2025-03-16 18:30:05,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 18:30:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2025-03-16 18:30:05,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 18:30:05,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:05,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:05,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 18:30:05,837 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 18:30:05,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:05,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash -807048619, now seen corresponding path program 2 times [2025-03-16 18:30:05,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:05,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594361811] [2025-03-16 18:30:05,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:30:05,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:05,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-16 18:30:05,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 32 statements. [2025-03-16 18:30:05,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 18:30:05,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 18:30:06,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:06,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594361811] [2025-03-16 18:30:06,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594361811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:30:06,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:30:06,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:30:06,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772337793] [2025-03-16 18:30:06,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:30:06,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:30:06,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:06,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:30:06,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:30:06,088 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:06,155 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2025-03-16 18:30:06,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:30:06,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2025-03-16 18:30:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:06,156 INFO L225 Difference]: With dead ends: 50 [2025-03-16 18:30:06,156 INFO L226 Difference]: Without dead ends: 48 [2025-03-16 18:30:06,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:30:06,157 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:06,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 115 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:30:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-16 18:30:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2025-03-16 18:30:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2025-03-16 18:30:06,163 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 32 [2025-03-16 18:30:06,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:06,163 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2025-03-16 18:30:06,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2025-03-16 18:30:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 18:30:06,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:06,164 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:06,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:30:06,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:06,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:06,165 INFO L85 PathProgramCache]: Analyzing trace with hash 330757207, now seen corresponding path program 1 times [2025-03-16 18:30:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:06,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653091722] [2025-03-16 18:30:06,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:06,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:06,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 18:30:06,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 18:30:06,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:06,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 18:30:06,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:06,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653091722] [2025-03-16 18:30:06,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653091722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:30:06,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151162719] [2025-03-16 18:30:06,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:06,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:06,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:06,312 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 18:30:06,315 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 18:30:06,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 18:30:06,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 18:30:06,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:06,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:06,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 18:30:06,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:30:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 18:30:06,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:30:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 18:30:06,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151162719] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:30:06,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:30:06,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-16 18:30:06,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418383179] [2025-03-16 18:30:06,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:30:06,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 18:30:06,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:06,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 18:30:06,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-16 18:30:06,546 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:06,750 INFO L93 Difference]: Finished difference Result 63 states and 97 transitions. [2025-03-16 18:30:06,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 18:30:06,750 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2025-03-16 18:30:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:06,751 INFO L225 Difference]: With dead ends: 63 [2025-03-16 18:30:06,751 INFO L226 Difference]: Without dead ends: 48 [2025-03-16 18:30:06,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2025-03-16 18:30:06,752 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 39 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:06,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 248 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:30:06,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-16 18:30:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2025-03-16 18:30:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2025-03-16 18:30:06,758 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 34 [2025-03-16 18:30:06,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:06,758 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2025-03-16 18:30:06,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2025-03-16 18:30:06,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 18:30:06,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:06,759 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:06,765 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 18:30:06,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:06,960 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:06,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:06,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1661851673, now seen corresponding path program 1 times [2025-03-16 18:30:06,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:06,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701390964] [2025-03-16 18:30:06,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:06,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:06,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 18:30:06,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 18:30:06,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:06,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 18:30:07,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:07,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701390964] [2025-03-16 18:30:07,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701390964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:30:07,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033674392] [2025-03-16 18:30:07,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:07,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:07,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:07,092 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 18:30:07,095 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 18:30:07,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 18:30:07,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 18:30:07,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:07,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:07,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 18:30:07,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:30:07,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 18:30:07,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:30:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 18:30:07,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033674392] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:30:07,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:30:07,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2025-03-16 18:30:07,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758381131] [2025-03-16 18:30:07,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:30:07,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 18:30:07,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:07,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 18:30:07,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:30:07,301 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:07,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:07,380 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2025-03-16 18:30:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:30:07,380 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2025-03-16 18:30:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:07,381 INFO L225 Difference]: With dead ends: 52 [2025-03-16 18:30:07,381 INFO L226 Difference]: Without dead ends: 43 [2025-03-16 18:30:07,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:30:07,382 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:07,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 231 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:30:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-16 18:30:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2025-03-16 18:30:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2025-03-16 18:30:07,388 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 34 [2025-03-16 18:30:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:07,388 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2025-03-16 18:30:07,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2025-03-16 18:30:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 18:30:07,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:07,389 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:07,396 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 18:30:07,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:07,590 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:07,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash 118232182, now seen corresponding path program 1 times [2025-03-16 18:30:07,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:07,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320927040] [2025-03-16 18:30:07,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:07,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:07,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 18:30:07,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 18:30:07,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:07,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 18:30:07,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:07,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320927040] [2025-03-16 18:30:07,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320927040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:30:07,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:30:07,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:30:07,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655514163] [2025-03-16 18:30:07,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:30:07,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:30:07,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:07,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:30:07,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:30:07,704 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:07,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:07,726 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2025-03-16 18:30:07,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:30:07,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2025-03-16 18:30:07,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:07,727 INFO L225 Difference]: With dead ends: 54 [2025-03-16 18:30:07,727 INFO L226 Difference]: Without dead ends: 45 [2025-03-16 18:30:07,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:30:07,727 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:07,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:30:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-16 18:30:07,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-16 18:30:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2025-03-16 18:30:07,736 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 34 [2025-03-16 18:30:07,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:07,737 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2025-03-16 18:30:07,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:07,737 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2025-03-16 18:30:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 18:30:07,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:07,737 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:07,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 18:30:07,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:07,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:07,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1711569808, now seen corresponding path program 1 times [2025-03-16 18:30:07,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:07,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685574019] [2025-03-16 18:30:07,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:07,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:07,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 18:30:07,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 18:30:07,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:07,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 18:30:07,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:07,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685574019] [2025-03-16 18:30:07,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685574019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:30:07,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275484180] [2025-03-16 18:30:07,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:07,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:07,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:07,860 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 18:30:07,861 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 18:30:07,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 18:30:07,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 18:30:07,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:07,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:07,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 18:30:07,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:30:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 18:30:07,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:30:07,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275484180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:30:07,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:30:07,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-16 18:30:07,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541798096] [2025-03-16 18:30:07,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:30:07,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:30:07,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:07,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:30:07,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:30:07,976 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:08,007 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2025-03-16 18:30:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:30:08,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2025-03-16 18:30:08,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:08,008 INFO L225 Difference]: With dead ends: 52 [2025-03-16 18:30:08,008 INFO L226 Difference]: Without dead ends: 47 [2025-03-16 18:30:08,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:30:08,009 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:08,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 109 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:30:08,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-16 18:30:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2025-03-16 18:30:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2025-03-16 18:30:08,014 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 35 [2025-03-16 18:30:08,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:08,014 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-03-16 18:30:08,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2025-03-16 18:30:08,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 18:30:08,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:08,015 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:08,021 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 18:30:08,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:08,216 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:08,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:08,217 INFO L85 PathProgramCache]: Analyzing trace with hash 241715758, now seen corresponding path program 1 times [2025-03-16 18:30:08,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:08,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318151573] [2025-03-16 18:30:08,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:08,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:08,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 18:30:08,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 18:30:08,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:08,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 18:30:08,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:08,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318151573] [2025-03-16 18:30:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318151573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:30:08,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941209944] [2025-03-16 18:30:08,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:08,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:08,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:08,339 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 18:30:08,352 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 18:30:08,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 18:30:08,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 18:30:08,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:08,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:08,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 18:30:08,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:30:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 18:30:08,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:30:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 18:30:08,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941209944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:30:08,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:30:08,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2025-03-16 18:30:08,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316056716] [2025-03-16 18:30:08,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:30:08,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 18:30:08,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:08,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 18:30:08,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:30:08,596 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:08,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:08,702 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2025-03-16 18:30:08,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 18:30:08,702 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2025-03-16 18:30:08,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:08,703 INFO L225 Difference]: With dead ends: 50 [2025-03-16 18:30:08,703 INFO L226 Difference]: Without dead ends: 45 [2025-03-16 18:30:08,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-16 18:30:08,704 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:08,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:30:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-16 18:30:08,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-16 18:30:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2025-03-16 18:30:08,710 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 37 [2025-03-16 18:30:08,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:08,710 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2025-03-16 18:30:08,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2025-03-16 18:30:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 18:30:08,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:08,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:08,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 18:30:08,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:08,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:08,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:08,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1254609199, now seen corresponding path program 1 times [2025-03-16 18:30:08,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:08,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107720602] [2025-03-16 18:30:08,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:08,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:08,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 18:30:08,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 18:30:08,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:08,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 18:30:09,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107720602] [2025-03-16 18:30:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107720602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:30:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603891136] [2025-03-16 18:30:09,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:09,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:09,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:09,032 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 18:30:09,033 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 18:30:09,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 18:30:09,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 18:30:09,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:09,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:09,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 18:30:09,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:30:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 18:30:09,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:30:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 18:30:09,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603891136] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:30:09,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:30:09,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-16 18:30:09,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742718300] [2025-03-16 18:30:09,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:30:09,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:30:09,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:09,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:30:09,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:30:09,179 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:09,201 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2025-03-16 18:30:09,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:30:09,201 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2025-03-16 18:30:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:09,202 INFO L225 Difference]: With dead ends: 46 [2025-03-16 18:30:09,202 INFO L226 Difference]: Without dead ends: 34 [2025-03-16 18:30:09,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:30:09,202 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:09,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:30:09,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-16 18:30:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-03-16 18:30:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2025-03-16 18:30:09,206 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 37 [2025-03-16 18:30:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:09,207 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-03-16 18:30:09,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2025-03-16 18:30:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 18:30:09,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:09,208 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:09,215 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 18:30:09,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:09,408 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:09,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:09,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1067161675, now seen corresponding path program 2 times [2025-03-16 18:30:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:09,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127120432] [2025-03-16 18:30:09,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:30:09,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:09,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-16 18:30:09,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 18:30:09,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:30:09,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 18:30:09,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:09,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127120432] [2025-03-16 18:30:09,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127120432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:30:09,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398779909] [2025-03-16 18:30:09,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:30:09,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:09,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:09,841 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 18:30:09,842 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 18:30:09,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-16 18:30:09,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 18:30:09,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:30:09,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:09,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-16 18:30:09,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:30:10,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-16 18:30:10,257 INFO L349 Elim1Store]: treesize reduction 72, result has 4.0 percent of original size [2025-03-16 18:30:10,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 25 [2025-03-16 18:30:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 18:30:10,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:30:10,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2025-03-16 18:30:10,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 18:30:10,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 138 [2025-03-16 18:30:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 18:30:10,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398779909] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:30:10,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:30:10,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 9] total 31 [2025-03-16 18:30:10,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754129501] [2025-03-16 18:30:10,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:30:10,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 18:30:10,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:10,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 18:30:10,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2025-03-16 18:30:10,641 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 31 states have internal predecessors, (59), 4 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-16 18:30:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:11,979 INFO L93 Difference]: Finished difference Result 92 states and 134 transitions. [2025-03-16 18:30:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-16 18:30:11,980 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 31 states have internal predecessors, (59), 4 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 38 [2025-03-16 18:30:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:11,980 INFO L225 Difference]: With dead ends: 92 [2025-03-16 18:30:11,980 INFO L226 Difference]: Without dead ends: 80 [2025-03-16 18:30:11,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=526, Invalid=3380, Unknown=0, NotChecked=0, Total=3906 [2025-03-16 18:30:11,982 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 97 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:11,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 219 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:30:11,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-16 18:30:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2025-03-16 18:30:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:30:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2025-03-16 18:30:11,992 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 38 [2025-03-16 18:30:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:11,992 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2025-03-16 18:30:11,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 31 states have internal predecessors, (59), 4 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-16 18:30:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2025-03-16 18:30:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 18:30:11,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:11,993 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:11,999 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 18:30:12,197 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,SelfDestructingSolverStorable10 [2025-03-16 18:30:12,197 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:12,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:12,197 INFO L85 PathProgramCache]: Analyzing trace with hash 178742927, now seen corresponding path program 3 times [2025-03-16 18:30:12,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:12,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525756193] [2025-03-16 18:30:12,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:30:12,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:12,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-03-16 18:30:12,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 41 statements. [2025-03-16 18:30:12,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-16 18:30:12,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 18:30:12,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:12,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525756193] [2025-03-16 18:30:12,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525756193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:30:12,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778312106] [2025-03-16 18:30:12,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:30:12,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:12,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:12,358 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 18:30:12,360 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 18:30:12,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-03-16 18:30:12,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 41 statements. [2025-03-16 18:30:12,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-16 18:30:12,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:12,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 18:30:12,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:30:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 18:30:12,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:30:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 18:30:12,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778312106] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:30:12,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:30:12,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 20 [2025-03-16 18:30:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716418906] [2025-03-16 18:30:12,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:30:12,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 18:30:12,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:12,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 18:30:12,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-16 18:30:12,697 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 20 states have internal predecessors, (46), 5 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-16 18:30:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:12,935 INFO L93 Difference]: Finished difference Result 110 states and 162 transitions. [2025-03-16 18:30:12,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 18:30:12,935 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 20 states have internal predecessors, (46), 5 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 5 states have call successors, (8) Word has length 41 [2025-03-16 18:30:12,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:12,936 INFO L225 Difference]: With dead ends: 110 [2025-03-16 18:30:12,936 INFO L226 Difference]: Without dead ends: 83 [2025-03-16 18:30:12,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2025-03-16 18:30:12,937 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 39 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:12,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 336 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:30:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-16 18:30:12,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2025-03-16 18:30:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-16 18:30:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2025-03-16 18:30:12,950 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 106 transitions. Word has length 41 [2025-03-16 18:30:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:12,950 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 106 transitions. [2025-03-16 18:30:12,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 20 states have internal predecessors, (46), 5 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-16 18:30:12,950 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 106 transitions. [2025-03-16 18:30:12,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 18:30:12,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:12,951 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:12,958 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 18:30:13,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:13,155 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:13,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:13,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1729219899, now seen corresponding path program 1 times [2025-03-16 18:30:13,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:13,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670892850] [2025-03-16 18:30:13,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:13,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:13,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 18:30:13,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 18:30:13,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:13,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 18:30:13,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:13,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670892850] [2025-03-16 18:30:13,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670892850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:30:13,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069979770] [2025-03-16 18:30:13,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:13,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:13,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:13,261 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 18:30:13,262 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 18:30:13,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 18:30:13,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 18:30:13,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:13,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:13,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 18:30:13,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:30:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 18:30:13,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:30:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 18:30:13,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069979770] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:30:13,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:30:13,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 15 [2025-03-16 18:30:13,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148100265] [2025-03-16 18:30:13,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:30:13,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 18:30:13,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:30:13,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 18:30:13,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-16 18:30:13,480 INFO L87 Difference]: Start difference. First operand 76 states and 106 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:30:13,619 INFO L93 Difference]: Finished difference Result 109 states and 156 transitions. [2025-03-16 18:30:13,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 18:30:13,619 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-03-16 18:30:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:30:13,620 INFO L225 Difference]: With dead ends: 109 [2025-03-16 18:30:13,620 INFO L226 Difference]: Without dead ends: 82 [2025-03-16 18:30:13,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2025-03-16 18:30:13,622 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:30:13,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 251 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:30:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-16 18:30:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2025-03-16 18:30:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-16 18:30:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2025-03-16 18:30:13,636 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 42 [2025-03-16 18:30:13,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:30:13,637 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2025-03-16 18:30:13,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 18:30:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2025-03-16 18:30:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 18:30:13,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:30:13,639 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:30:13,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 18:30:13,840 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,SelfDestructingSolverStorable12 [2025-03-16 18:30:13,840 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:30:13,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:30:13,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1922339369, now seen corresponding path program 1 times [2025-03-16 18:30:13,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:30:13,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619407116] [2025-03-16 18:30:13,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:13,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:30:13,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 18:30:13,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 18:30:13,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:13,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 18:30:15,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:30:15,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619407116] [2025-03-16 18:30:15,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619407116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:30:15,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616377605] [2025-03-16 18:30:15,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:30:15,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:30:15,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:30:15,074 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 18:30:15,076 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 18:30:15,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 18:30:15,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 18:30:15,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:30:15,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:30:15,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-03-16 18:30:15,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:30:15,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 18:30:15,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2025-03-16 18:30:15,332 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-16 18:30:15,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-03-16 18:30:15,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2025-03-16 18:30:15,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-16 18:30:15,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-03-16 18:30:15,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2025-03-16 18:30:15,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2025-03-16 18:30:15,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2025-03-16 18:30:15,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2025-03-16 18:30:15,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2025-03-16 18:30:16,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2025-03-16 18:30:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 18:30:16,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:30:46,762 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_377 Int) (|v_ULTIMATE.start_upsweep_~left~0#1_40| Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (|v_ULTIMATE.start_upsweep_~a#1.offset_22| Int)) (or (< |v_ULTIMATE.start_upsweep_~left~0#1_40| 0) (let ((.cse8 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~a0~0#1.base| (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse8) (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse8))) (+ |ULTIMATE.start_main_~a0~0#1.offset| 4 .cse8) v_ArrVal_377)))) (let ((.cse1 (store (let ((.cse7 (* |v_ULTIMATE.start_upsweep_~left~0#1_40| 4))) (let ((.cse6 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_22| 4 .cse7)) (.cse5 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (select .cse5 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_22| .cse7)))))) (+ |ULTIMATE.start_main_~a~0#1.offset| 4 .cse8) 0)) (.cse2 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (select .cse1 .cse2))) (let ((.cse3 (+ (select .cse1 |ULTIMATE.start_main_~a~0#1.offset|) .cse4))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 .cse2 .cse3) |ULTIMATE.start_main_~a~0#1.offset| .cse4)) |c_ULTIMATE.start_main_~a0~0#1.base|) |ULTIMATE.start_main_~a0~0#1.offset|) .cse3)))))) (< |v_ULTIMATE.start_upsweep_~a#1.offset_22| |ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2025-03-16 18:31:40,771 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_377 Int) (|v_ULTIMATE.start_upsweep_~left~0#1_40| Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_ArrVal_385 (Array Int Int)) (|v_ULTIMATE.start_upsweep_~a#1.offset_22| Int)) (or (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc16#1.base| (store (store v_ArrVal_385 |ULTIMATE.start_main_~a0~0#1.offset| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc16#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (+ |ULTIMATE.start_main_~a0~0#1.offset| 4) v_ArrVal_377)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (select .cse1 |ULTIMATE.start_main_~a~0#1.offset|))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse3 (* |v_ULTIMATE.start_upsweep_~left~0#1_40| 4))) (let ((.cse2 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_22| 4 .cse3))) (store .cse1 .cse2 (+ (select .cse1 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_22| .cse3)) (select .cse1 .cse2))))) (+ |ULTIMATE.start_main_~a~0#1.offset| 4) .cse4) |ULTIMATE.start_main_~a~0#1.offset| 0)) |c_ULTIMATE.start_main_#t~malloc16#1.base|) |ULTIMATE.start_main_~a0~0#1.offset|) .cse4)))) (< |v_ULTIMATE.start_upsweep_~left~0#1_40| 0) (< |v_ULTIMATE.start_upsweep_~a#1.offset_22| |ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2025-03-16 18:31:40,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616377605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:31:40,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:31:40,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2025-03-16 18:31:40,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679998878] [2025-03-16 18:31:40,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:31:40,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-16 18:31:40,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:40,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-16 18:31:40,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2725, Unknown=9, NotChecked=214, Total=3192 [2025-03-16 18:31:40,780 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 42 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 37 states have internal predecessors, (54), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6)