./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/sanfoundry_10_ground.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/array-examples/sanfoundry_10_ground.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 2638891780f697dd700286595ba75a607e61cda7473ecc330660e8dbb3e9ba64 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 08:58:54,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 08:58:54,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 08:58:54,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 08:58:54,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 08:58:54,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 08:58:54,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 08:58:54,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 08:58:54,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 08:58:54,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 08:58:54,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 08:58:54,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 08:58:54,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 08:58:54,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 08:58:54,510 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 08:58:54,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 08:58:54,511 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 08:58:54,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 08:58:54,512 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 08:58:54,512 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 08:58:54,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 08:58:54,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 08:58:54,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 08:58:54,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 08:58:54,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 08:58:54,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 08:58:54,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 08:58:54,513 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 08:58:54,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 08:58:54,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 08:58:54,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 08:58:54,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 08:58:54,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 08:58:54,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 08:58:54,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 08:58:54,513 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 -> 2638891780f697dd700286595ba75a607e61cda7473ecc330660e8dbb3e9ba64 [2025-03-03 08:58:54,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 08:58:54,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 08:58:54,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 08:58:54,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 08:58:54,751 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 08:58:54,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/sanfoundry_10_ground.c [2025-03-03 08:58:55,878 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d1be55bc/a3f56bd6604c4f56bff3dd7d4dc7ae75/FLAGbd6ca5487 [2025-03-03 08:58:56,125 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 08:58:56,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sanfoundry_10_ground.c [2025-03-03 08:58:56,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d1be55bc/a3f56bd6604c4f56bff3dd7d4dc7ae75/FLAGbd6ca5487 [2025-03-03 08:58:56,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d1be55bc/a3f56bd6604c4f56bff3dd7d4dc7ae75 [2025-03-03 08:58:56,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 08:58:56,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 08:58:56,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 08:58:56,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 08:58:56,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 08:58:56,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56, skipping insertion in model container [2025-03-03 08:58:56,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 08:58:56,272 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/array-examples/sanfoundry_10_ground.c[324,337] [2025-03-03 08:58:56,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 08:58:56,297 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 08:58:56,304 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/array-examples/sanfoundry_10_ground.c[324,337] [2025-03-03 08:58:56,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 08:58:56,327 INFO L204 MainTranslator]: Completed translation [2025-03-03 08:58:56,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56 WrapperNode [2025-03-03 08:58:56,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 08:58:56,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 08:58:56,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 08:58:56,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 08:58:56,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,351 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2025-03-03 08:58:56,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 08:58:56,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 08:58:56,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 08:58:56,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 08:58:56,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,376 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-03 08:58:56,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,379 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 08:58:56,383 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 08:58:56,383 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 08:58:56,383 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 08:58:56,384 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 08:58:56,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:56,408 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-03 08:58:56,411 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-03 08:58:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 08:58:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 08:58:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 08:58:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 08:58:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 08:58:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 08:58:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 08:58:56,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 08:58:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 08:58:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 08:58:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 08:58:56,477 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 08:58:56,478 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 08:58:56,612 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19: call ULTIMATE.dealloc(main_~#vectorx~0#1.base, main_~#vectorx~0#1.offset);havoc main_~#vectorx~0#1.base, main_~#vectorx~0#1.offset; [2025-03-03 08:58:56,622 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 08:58:56,622 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 08:58:56,629 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 08:58:56,629 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 08:58:56,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:58:56 BoogieIcfgContainer [2025-03-03 08:58:56,631 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 08:58:56,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 08:58:56,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 08:58:56,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 08:58:56,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:58:56" (1/3) ... [2025-03-03 08:58:56,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b8c156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:58:56, skipping insertion in model container [2025-03-03 08:58:56,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (2/3) ... [2025-03-03 08:58:56,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b8c156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:58:56, skipping insertion in model container [2025-03-03 08:58:56,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:58:56" (3/3) ... [2025-03-03 08:58:56,638 INFO L128 eAbstractionObserver]: Analyzing ICFG sanfoundry_10_ground.c [2025-03-03 08:58:56,652 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 08:58:56,653 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sanfoundry_10_ground.c that has 1 procedures, 18 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 08:58:56,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 08:58:56,704 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;@6afecec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 08:58:56,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 08:58:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 08:58:56,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:56,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:56,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:56,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:56,716 INFO L85 PathProgramCache]: Analyzing trace with hash -593889169, now seen corresponding path program 1 times [2025-03-03 08:58:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:56,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798817271] [2025-03-03 08:58:56,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:56,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 08:58:56,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 08:58:56,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:56,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 08:58:56,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:56,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798817271] [2025-03-03 08:58:56,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798817271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:58:56,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:58:56,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 08:58:56,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481626624] [2025-03-03 08:58:56,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:58:56,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 08:58:56,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:56,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 08:58:56,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 08:58:56,940 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:56,980 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2025-03-03 08:58:56,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 08:58:56,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-03 08:58:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:56,986 INFO L225 Difference]: With dead ends: 34 [2025-03-03 08:58:56,988 INFO L226 Difference]: Without dead ends: 15 [2025-03-03 08:58:56,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 08:58:56,993 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:56,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:58:57,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-03 08:58:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-03 08:58:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-03-03 08:58:57,017 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 9 [2025-03-03 08:58:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:57,018 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-03 08:58:57,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2025-03-03 08:58:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 08:58:57,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:57,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:57,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 08:58:57,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:57,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1547414072, now seen corresponding path program 1 times [2025-03-03 08:58:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:57,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983021491] [2025-03-03 08:58:57,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:57,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 08:58:57,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 08:58:57,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 08:58:57,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:57,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983021491] [2025-03-03 08:58:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983021491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:58:57,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:58:57,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 08:58:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340579442] [2025-03-03 08:58:57,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:58:57,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 08:58:57,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:57,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 08:58:57,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 08:58:57,130 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:57,177 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2025-03-03 08:58:57,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 08:58:57,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 08:58:57,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:57,178 INFO L225 Difference]: With dead ends: 31 [2025-03-03 08:58:57,178 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 08:58:57,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 08:58:57,179 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:57,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:58:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 08:58:57,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2025-03-03 08:58:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-03-03 08:58:57,182 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 10 [2025-03-03 08:58:57,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:57,182 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-03 08:58:57,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,183 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2025-03-03 08:58:57,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 08:58:57,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:57,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:57,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 08:58:57,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:57,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:57,184 INFO L85 PathProgramCache]: Analyzing trace with hash -815735827, now seen corresponding path program 1 times [2025-03-03 08:58:57,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:57,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633943367] [2025-03-03 08:58:57,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:57,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 08:58:57,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 08:58:57,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 08:58:57,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:57,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633943367] [2025-03-03 08:58:57,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633943367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:58:57,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:58:57,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 08:58:57,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297459240] [2025-03-03 08:58:57,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:58:57,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 08:58:57,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:57,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 08:58:57,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 08:58:57,265 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:57,276 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2025-03-03 08:58:57,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 08:58:57,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-03 08:58:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:57,278 INFO L225 Difference]: With dead ends: 28 [2025-03-03 08:58:57,278 INFO L226 Difference]: Without dead ends: 17 [2025-03-03 08:58:57,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 08:58:57,279 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:57,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 25 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:58:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-03 08:58:57,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-03 08:58:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-03-03 08:58:57,284 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2025-03-03 08:58:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:57,285 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-03-03 08:58:57,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2025-03-03 08:58:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 08:58:57,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:57,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:57,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 08:58:57,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:57,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash 456166302, now seen corresponding path program 1 times [2025-03-03 08:58:57,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:57,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840809285] [2025-03-03 08:58:57,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:57,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 08:58:57,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 08:58:57,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 08:58:57,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:57,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840809285] [2025-03-03 08:58:57,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840809285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:58:57,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371021731] [2025-03-03 08:58:57,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:57,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:57,418 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-03 08:58:57,420 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-03 08:58:57,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 08:58:57,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 08:58:57,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 08:58:57,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:58:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 08:58:57,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:58:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 08:58:57,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371021731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:58:57,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:58:57,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-03-03 08:58:57,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752318952] [2025-03-03 08:58:57,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:58:57,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 08:58:57,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:57,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 08:58:57,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-03 08:58:57,547 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:57,678 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2025-03-03 08:58:57,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 08:58:57,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-03 08:58:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:57,678 INFO L225 Difference]: With dead ends: 55 [2025-03-03 08:58:57,678 INFO L226 Difference]: Without dead ends: 42 [2025-03-03 08:58:57,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2025-03-03 08:58:57,679 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 57 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:57,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 27 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:58:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-03 08:58:57,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2025-03-03 08:58:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-03 08:58:57,684 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2025-03-03 08:58:57,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:57,684 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-03 08:58:57,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-03 08:58:57,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 08:58:57,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:57,685 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:57,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 08:58:57,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:57,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:57,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:57,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1923851222, now seen corresponding path program 1 times [2025-03-03 08:58:57,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:57,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865930358] [2025-03-03 08:58:57,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:57,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 08:58:57,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 08:58:57,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 08:58:58,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:58,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865930358] [2025-03-03 08:58:58,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865930358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:58:58,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279464482] [2025-03-03 08:58:58,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:58,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:58,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:58,004 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-03 08:58:58,005 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-03 08:58:58,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 08:58:58,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 08:58:58,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:58,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:58,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 08:58:58,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:58:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 08:58:58,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:58:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 08:58:58,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279464482] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:58:58,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:58:58,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-03 08:58:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869099025] [2025-03-03 08:58:58,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:58:58,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 08:58:58,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:58,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 08:58:58,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2025-03-03 08:58:58,218 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:58,322 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2025-03-03 08:58:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 08:58:58,323 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-03 08:58:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:58,323 INFO L225 Difference]: With dead ends: 60 [2025-03-03 08:58:58,323 INFO L226 Difference]: Without dead ends: 30 [2025-03-03 08:58:58,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2025-03-03 08:58:58,324 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:58,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 54 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:58:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-03 08:58:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-03 08:58:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-03-03 08:58:58,329 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2025-03-03 08:58:58,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:58,329 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-03-03 08:58:58,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:58,329 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-03-03 08:58:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 08:58:58,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:58,330 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:58,335 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-03 08:58:58,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:58,531 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:58,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:58,531 INFO L85 PathProgramCache]: Analyzing trace with hash 904279163, now seen corresponding path program 1 times [2025-03-03 08:58:58,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:58,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982157917] [2025-03-03 08:58:58,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:58,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:58,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 08:58:58,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 08:58:58,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:58,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:58:58,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:58,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982157917] [2025-03-03 08:58:58,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982157917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:58:58,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434882559] [2025-03-03 08:58:58,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:58,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:58,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:58,770 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-03 08:58:58,771 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-03 08:58:58,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 08:58:58,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 08:58:58,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:58,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:58,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 08:58:58,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:58:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:58:58,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:58:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:58:59,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434882559] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:58:59,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:58:59,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2025-03-03 08:58:59,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928220177] [2025-03-03 08:58:59,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:58:59,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 08:58:59,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:59,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 08:58:59,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=640, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 08:58:59,181 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 35 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:59,251 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2025-03-03 08:58:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 08:58:59,252 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-03 08:58:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:59,252 INFO L225 Difference]: With dead ends: 56 [2025-03-03 08:58:59,253 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 08:58:59,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=550, Invalid=640, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 08:58:59,254 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:59,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:58:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 08:58:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2025-03-03 08:58:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2025-03-03 08:58:59,259 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 26 [2025-03-03 08:58:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:59,259 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2025-03-03 08:58:59,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2025-03-03 08:58:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 08:58:59,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:59,260 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:59,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 08:58:59,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:59,462 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:59,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:59,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1109070405, now seen corresponding path program 2 times [2025-03-03 08:58:59,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:59,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661795700] [2025-03-03 08:58:59,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:58:59,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:59,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 08:58:59,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 08:58:59,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:58:59,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:58:59,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:59,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661795700] [2025-03-03 08:58:59,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661795700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:58:59,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139695622] [2025-03-03 08:58:59,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:58:59,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:59,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:59,967 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-03 08:58:59,967 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-03 08:59:00,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 08:59:00,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 08:59:00,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:00,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:00,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 08:59:00,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:00,431 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:00,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:01,093 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:01,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139695622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:01,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:01,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 71 [2025-03-03 08:59:01,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299535519] [2025-03-03 08:59:01,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:01,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-03 08:59:01,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:01,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-03 08:59:01,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2254, Invalid=2716, Unknown=0, NotChecked=0, Total=4970 [2025-03-03 08:59:01,100 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 71 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 71 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:01,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:01,176 INFO L93 Difference]: Finished difference Result 80 states and 110 transitions. [2025-03-03 08:59:01,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-03 08:59:01,177 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 71 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 08:59:01,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:01,177 INFO L225 Difference]: With dead ends: 80 [2025-03-03 08:59:01,177 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 08:59:01,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2045 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2254, Invalid=2716, Unknown=0, NotChecked=0, Total=4970 [2025-03-03 08:59:01,179 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:01,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:59:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 08:59:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2025-03-03 08:59:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2025-03-03 08:59:01,186 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 38 [2025-03-03 08:59:01,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:01,186 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2025-03-03 08:59:01,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 71 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2025-03-03 08:59:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 08:59:01,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:01,187 INFO L218 NwaCegarLoop]: trace histogram [46, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:01,194 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-03 08:59:01,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:01,388 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:01,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1796128827, now seen corresponding path program 3 times [2025-03-03 08:59:01,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:01,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853369891] [2025-03-03 08:59:01,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 08:59:01,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:01,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 24 equivalence classes. [2025-03-03 08:59:01,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 62 statements. [2025-03-03 08:59:01,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 08:59:01,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1082 trivial. 0 not checked. [2025-03-03 08:59:01,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:01,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853369891] [2025-03-03 08:59:01,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853369891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:01,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564659695] [2025-03-03 08:59:01,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 08:59:01,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:01,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:01,587 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-03 08:59:01,588 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-03 08:59:01,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 24 equivalence classes. [2025-03-03 08:59:01,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 62 statements. [2025-03-03 08:59:01,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 08:59:01,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:01,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 08:59:01,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2025-03-03 08:59:01,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2025-03-03 08:59:01,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564659695] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:01,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:01,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2025-03-03 08:59:01,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406433002] [2025-03-03 08:59:01,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:01,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 08:59:01,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:01,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 08:59:01,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-03 08:59:01,868 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:02,226 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2025-03-03 08:59:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 08:59:02,226 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 08:59:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:02,227 INFO L225 Difference]: With dead ends: 104 [2025-03-03 08:59:02,227 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 08:59:02,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 08:59:02,228 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 76 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:02,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 98 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:59:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 08:59:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2025-03-03 08:59:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 85 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2025-03-03 08:59:02,240 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 62 [2025-03-03 08:59:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:02,240 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2025-03-03 08:59:02,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2025-03-03 08:59:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 08:59:02,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:02,241 INFO L218 NwaCegarLoop]: trace histogram [46, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:02,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 08:59:02,442 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-03 08:59:02,442 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:02,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:02,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1895066224, now seen corresponding path program 1 times [2025-03-03 08:59:02,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:02,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859649173] [2025-03-03 08:59:02,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:02,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:02,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 08:59:02,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 08:59:02,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:02,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 08:59:03,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859649173] [2025-03-03 08:59:03,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859649173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519516348] [2025-03-03 08:59:03,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:03,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:03,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:03,999 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-03 08:59:04,000 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-03 08:59:04,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 08:59:04,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 08:59:04,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:04,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:04,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-03 08:59:04,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 08:59:05,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 08:59:06,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519516348] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:06,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:06,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 143 [2025-03-03 08:59:06,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917089286] [2025-03-03 08:59:06,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:06,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 143 states [2025-03-03 08:59:06,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:06,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2025-03-03 08:59:06,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9118, Invalid=11188, Unknown=0, NotChecked=0, Total=20306 [2025-03-03 08:59:06,993 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 143 states, 143 states have (on average 1.097902097902098) internal successors, (157), 143 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:07,135 INFO L93 Difference]: Finished difference Result 172 states and 233 transitions. [2025-03-03 08:59:07,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-03 08:59:07,135 INFO L78 Accepts]: Start accepts. Automaton has has 143 states, 143 states have (on average 1.097902097902098) internal successors, (157), 143 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 08:59:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:07,136 INFO L225 Difference]: With dead ends: 172 [2025-03-03 08:59:07,136 INFO L226 Difference]: Without dead ends: 135 [2025-03-03 08:59:07,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8693 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=9118, Invalid=11188, Unknown=0, NotChecked=0, Total=20306 [2025-03-03 08:59:07,144 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:07,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:59:07,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-03 08:59:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2025-03-03 08:59:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.0601503759398496) internal successors, (141), 133 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2025-03-03 08:59:07,159 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 65 [2025-03-03 08:59:07,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:07,160 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2025-03-03 08:59:07,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 143 states, 143 states have (on average 1.097902097902098) internal successors, (157), 143 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:07,160 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2025-03-03 08:59:07,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 08:59:07,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:07,162 INFO L218 NwaCegarLoop]: trace histogram [94, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:07,169 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-03 08:59:07,367 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-03 08:59:07,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:07,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash 971056496, now seen corresponding path program 2 times [2025-03-03 08:59:07,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:07,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773026037] [2025-03-03 08:59:07,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:07,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:07,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-03 08:59:07,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 08:59:07,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:07,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4476 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 08:59:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773026037] [2025-03-03 08:59:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773026037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039359398] [2025-03-03 08:59:11,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:11,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:11,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:11,937 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-03 08:59:11,937 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-03 08:59:12,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-03 08:59:12,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 08:59:12,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:12,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:12,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-03 08:59:12,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:15,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4476 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 08:59:15,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4476 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 08:59:22,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039359398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:22,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:22,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 287 [2025-03-03 08:59:22,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835099571] [2025-03-03 08:59:22,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:22,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 287 states [2025-03-03 08:59:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:22,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 287 interpolants. [2025-03-03 08:59:22,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36670, Invalid=45412, Unknown=0, NotChecked=0, Total=82082 [2025-03-03 08:59:22,710 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand has 287 states, 287 states have (on average 1.048780487804878) internal successors, (301), 287 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:23,127 INFO L93 Difference]: Finished difference Result 268 states and 377 transitions. [2025-03-03 08:59:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-03 08:59:23,128 INFO L78 Accepts]: Start accepts. Automaton has has 287 states, 287 states have (on average 1.048780487804878) internal successors, (301), 287 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-03 08:59:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:23,129 INFO L225 Difference]: With dead ends: 268 [2025-03-03 08:59:23,129 INFO L226 Difference]: Without dead ends: 231 [2025-03-03 08:59:23,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35813 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=36670, Invalid=45412, Unknown=0, NotChecked=0, Total=82082 [2025-03-03 08:59:23,133 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:23,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:59:23,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-03 08:59:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 230. [2025-03-03 08:59:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.034934497816594) internal successors, (237), 229 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 237 transitions. [2025-03-03 08:59:23,150 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 237 transitions. Word has length 113 [2025-03-03 08:59:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:23,151 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 237 transitions. [2025-03-03 08:59:23,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 287 states, 287 states have (on average 1.048780487804878) internal successors, (301), 287 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 237 transitions. [2025-03-03 08:59:23,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 08:59:23,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:23,157 INFO L218 NwaCegarLoop]: trace histogram [190, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:23,164 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-03 08:59:23,357 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-03 08:59:23,358 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:23,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash 171219824, now seen corresponding path program 3 times [2025-03-03 08:59:23,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:23,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248548229] [2025-03-03 08:59:23,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 08:59:23,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:23,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 209 statements into 96 equivalence classes. [2025-03-03 08:59:23,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 209 statements. [2025-03-03 08:59:23,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 08:59:23,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18156 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2025-03-03 08:59:23,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:23,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248548229] [2025-03-03 08:59:23,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248548229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:23,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936674473] [2025-03-03 08:59:23,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 08:59:23,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:23,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:23,515 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-03 08:59:23,516 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-03 08:59:23,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 209 statements into 96 equivalence classes. [2025-03-03 08:59:23,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 209 statements. [2025-03-03 08:59:23,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 08:59:23,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:23,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 08:59:23,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 18156 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2025-03-03 08:59:23,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18156 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2025-03-03 08:59:24,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936674473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:24,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:24,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2025-03-03 08:59:24,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901343309] [2025-03-03 08:59:24,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:24,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 08:59:24,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:24,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 08:59:24,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2025-03-03 08:59:24,121 INFO L87 Difference]: Start difference. First operand 230 states and 237 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:24,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:24,376 INFO L93 Difference]: Finished difference Result 285 states and 310 transitions. [2025-03-03 08:59:24,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 08:59:24,377 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2025-03-03 08:59:24,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:24,378 INFO L225 Difference]: With dead ends: 285 [2025-03-03 08:59:24,378 INFO L226 Difference]: Without dead ends: 276 [2025-03-03 08:59:24,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 405 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=643, Invalid=1427, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 08:59:24,379 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 149 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:24,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 71 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:59:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-03 08:59:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 245. [2025-03-03 08:59:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.0450819672131149) internal successors, (255), 244 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 255 transitions. [2025-03-03 08:59:24,394 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 255 transitions. Word has length 209 [2025-03-03 08:59:24,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:24,394 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 255 transitions. [2025-03-03 08:59:24,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 255 transitions. [2025-03-03 08:59:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 08:59:24,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:24,396 INFO L218 NwaCegarLoop]: trace histogram [190, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:24,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 08:59:24,596 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-03 08:59:24,596 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:24,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1149879371, now seen corresponding path program 4 times [2025-03-03 08:59:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:24,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578157190] [2025-03-03 08:59:24,597 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 08:59:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:24,653 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 213 statements into 2 equivalence classes. [2025-03-03 08:59:24,657 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 213 statements. [2025-03-03 08:59:24,657 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 08:59:24,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:24,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18167 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 18145 trivial. 0 not checked. [2025-03-03 08:59:24,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:24,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578157190] [2025-03-03 08:59:24,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578157190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:24,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872092773] [2025-03-03 08:59:24,908 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 08:59:24,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:24,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:24,910 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-03 08:59:24,911 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-03 08:59:25,124 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 213 statements into 2 equivalence classes. [2025-03-03 08:59:25,132 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 213 statements. [2025-03-03 08:59:25,132 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 08:59:25,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:25,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 08:59:25,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:25,194 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2025-03-03 08:59:25,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 35 [2025-03-03 08:59:25,297 INFO L349 Elim1Store]: treesize reduction 101, result has 26.8 percent of original size [2025-03-03 08:59:25,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 67 [2025-03-03 08:59:29,613 INFO L349 Elim1Store]: treesize reduction 272, result has 41.6 percent of original size [2025-03-03 08:59:29,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 118 treesize of output 254 [2025-03-03 08:59:34,608 INFO L349 Elim1Store]: treesize reduction 101, result has 26.8 percent of original size [2025-03-03 08:59:34,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 67 [2025-03-03 09:00:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 18167 backedges. 6 proven. 14 refuted. 2 times theorem prover too weak. 18145 trivial. 0 not checked. [2025-03-03 09:00:14,820 INFO L312 TraceCheckSpWp]: Computing backward predicates...