./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/Mono3_1.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/loops-crafted-1/Mono3_1.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 0756a7f5fb7c80ee6b59c75ec6cf9015a96d2c6a2bbe84a426dbe33a7087e683 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:35:33,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:35:33,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:35:33,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:35:33,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:35:33,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:35:33,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:35:33,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:35:33,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:35:33,373 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:35:33,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:35:33,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:35:33,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:35:33,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:35:33,373 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:35:33,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:35:33,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:35:33,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:35:33,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:35:33,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:35:33,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:35:33,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:35:33,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:35:33,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:35:33,374 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:35:33,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:35:33,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:35:33,374 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:35:33,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:35:33,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:35:33,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:35:33,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:35:33,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:35:33,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:35:33,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:35:33,375 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:35:33,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:35:33,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:35:33,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:35:33,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:35:33,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:35:33,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:35:33,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:35:33,376 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 -> 0756a7f5fb7c80ee6b59c75ec6cf9015a96d2c6a2bbe84a426dbe33a7087e683 [2025-03-03 13:35:33,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:35:33,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:35:33,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:35:33,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:35:33,644 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:35:33,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/Mono3_1.c [2025-03-03 13:35:34,801 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8ece64f/7d2e4863c6f64acf897093081fa7f90d/FLAG3c727b46d [2025-03-03 13:35:35,036 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:35:35,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono3_1.c [2025-03-03 13:35:35,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8ece64f/7d2e4863c6f64acf897093081fa7f90d/FLAG3c727b46d [2025-03-03 13:35:35,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8ece64f/7d2e4863c6f64acf897093081fa7f90d [2025-03-03 13:35:35,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:35:35,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:35:35,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:35:35,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:35:35,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:35:35,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:35:35" (1/1) ... [2025-03-03 13:35:35,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552e9714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35, skipping insertion in model container [2025-03-03 13:35:35,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:35:35" (1/1) ... [2025-03-03 13:35:35,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:35:35,489 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/loops-crafted-1/Mono3_1.c[311,324] [2025-03-03 13:35:35,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:35:35,502 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:35:35,508 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/loops-crafted-1/Mono3_1.c[311,324] [2025-03-03 13:35:35,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:35:35,519 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:35:35,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35 WrapperNode [2025-03-03 13:35:35,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:35:35,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:35:35,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:35:35,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:35:35,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35" (1/1) ... [2025-03-03 13:35:35,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35" (1/1) ... [2025-03-03 13:35:35,537 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 28 [2025-03-03 13:35:35,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:35:35,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:35:35,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:35:35,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:35:35,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35" (1/1) ... [2025-03-03 13:35:35,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35" (1/1) ... [2025-03-03 13:35:35,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35" (1/1) ... [2025-03-03 13:35:35,548 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:35:35,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35" (1/1) ... [2025-03-03 13:35:35,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35" (1/1) ... [2025-03-03 13:35:35,550 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35" (1/1) ... [2025-03-03 13:35:35,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35" (1/1) ... [2025-03-03 13:35:35,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35" (1/1) ... [2025-03-03 13:35:35,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35" (1/1) ... [2025-03-03 13:35:35,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:35:35,552 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:35:35,552 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:35:35,552 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:35:35,553 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35" (1/1) ... [2025-03-03 13:35:35,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:35:35,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:35,577 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 13:35:35,579 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 13:35:35,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:35:35,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:35:35,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:35:35,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:35:35,632 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:35:35,634 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:35:35,709 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-03 13:35:35,710 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:35:35,717 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:35:35,718 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:35:35,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:35:35 BoogieIcfgContainer [2025-03-03 13:35:35,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:35:35,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:35:35,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:35:35,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:35:35,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:35:35" (1/3) ... [2025-03-03 13:35:35,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc46964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:35:35, skipping insertion in model container [2025-03-03 13:35:35,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:35" (2/3) ... [2025-03-03 13:35:35,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc46964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:35:35, skipping insertion in model container [2025-03-03 13:35:35,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:35:35" (3/3) ... [2025-03-03 13:35:35,729 INFO L128 eAbstractionObserver]: Analyzing ICFG Mono3_1.c [2025-03-03 13:35:35,741 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:35:35,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Mono3_1.c that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 13:35:35,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:35:35,796 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;@1323446e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:35:35,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:35:35,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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 13:35:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 13:35:35,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:35,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 13:35:35,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:35,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:35,807 INFO L85 PathProgramCache]: Analyzing trace with hash 40044997, now seen corresponding path program 1 times [2025-03-03 13:35:35,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:35,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527514964] [2025-03-03 13:35:35,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:35:35,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:35,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 13:35:35,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 13:35:35,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:35:35,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:35,992 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 13:35:35,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:35,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527514964] [2025-03-03 13:35:35,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527514964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:35:35,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:35:35,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:35:35,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603778180] [2025-03-03 13:35:35,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:35:35,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:35:36,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:36,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:35:36,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:35:36,016 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 13:35:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:35:36,050 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2025-03-03 13:35:36,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:35:36,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-03 13:35:36,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:35:36,059 INFO L225 Difference]: With dead ends: 25 [2025-03-03 13:35:36,059 INFO L226 Difference]: Without dead ends: 11 [2025-03-03 13:35:36,061 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 13:35:36,063 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:35:36,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:35:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-03 13:35:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-03-03 13:35:36,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 13:35:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-03-03 13:35:36,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 5 [2025-03-03 13:35:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:35:36,086 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-03 13:35:36,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 13:35:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2025-03-03 13:35:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:35:36,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:36,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:35:36,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:35:36,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:36,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:36,089 INFO L85 PathProgramCache]: Analyzing trace with hash -902066916, now seen corresponding path program 1 times [2025-03-03 13:35:36,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:36,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678204033] [2025-03-03 13:35:36,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:35:36,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:36,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:35:36,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:35:36,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:35:36,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:35:36,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:36,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678204033] [2025-03-03 13:35:36,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678204033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:35:36,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014878067] [2025-03-03 13:35:36,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:35:36,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:36,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:36,272 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 13:35:36,274 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 13:35:36,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:35:36,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:35:36,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:35:36,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:36,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:35:36,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:35:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:35:36,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:35:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:35:36,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014878067] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:35:36,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:35:36,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2025-03-03 13:35:36,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669676528] [2025-03-03 13:35:36,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:35:36,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:35:36,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:36,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:35:36,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:35:36,508 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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 13:35:36,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:35:36,632 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2025-03-03 13:35:36,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:35:36,634 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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) Word has length 8 [2025-03-03 13:35:36,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:35:36,634 INFO L225 Difference]: With dead ends: 26 [2025-03-03 13:35:36,634 INFO L226 Difference]: Without dead ends: 19 [2025-03-03 13:35:36,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:35:36,635 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:35:36,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:35:36,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-03 13:35:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2025-03-03 13:35:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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 13:35:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-03-03 13:35:36,639 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 8 [2025-03-03 13:35:36,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:35:36,639 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-03-03 13:35:36,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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 13:35:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-03-03 13:35:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 13:35:36,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:36,640 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:35:36,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 13:35:36,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:36,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:36,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:36,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1603154941, now seen corresponding path program 1 times [2025-03-03 13:35:36,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:36,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341672740] [2025-03-03 13:35:36,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:35:36,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:36,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:35:36,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:35:36,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:35:36,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:35:36,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:36,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341672740] [2025-03-03 13:35:36,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341672740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:35:36,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921315807] [2025-03-03 13:35:36,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:35:36,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:36,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:36,979 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 13:35:36,981 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 13:35:37,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:35:37,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:35:37,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:35:37,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:37,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:35:37,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:35:37,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:35:37,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:35:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:35:37,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921315807] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:35:37,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:35:37,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2025-03-03 13:35:37,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415137740] [2025-03-03 13:35:37,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:35:37,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:35:37,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:37,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:35:37,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:35:37,140 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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 13:35:37,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:35:37,312 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2025-03-03 13:35:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 13:35:37,313 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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 13:35:37,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:35:37,314 INFO L225 Difference]: With dead ends: 47 [2025-03-03 13:35:37,314 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 13:35:37,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:35:37,314 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:35:37,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 33 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:35:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 13:35:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-03 13:35:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 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 13:35:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2025-03-03 13:35:37,324 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 14 [2025-03-03 13:35:37,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:35:37,324 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-03-03 13:35:37,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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 13:35:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2025-03-03 13:35:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 13:35:37,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:37,326 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1] [2025-03-03 13:35:37,332 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 13:35:37,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 13:35:37,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:37,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:37,528 INFO L85 PathProgramCache]: Analyzing trace with hash -886904772, now seen corresponding path program 2 times [2025-03-03 13:35:37,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:37,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335222459] [2025-03-03 13:35:37,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:35:37,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:37,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-03 13:35:37,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:35:37,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:35:37,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:35:37,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:37,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335222459] [2025-03-03 13:35:37,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335222459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:35:37,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121655610] [2025-03-03 13:35:37,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:35:37,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:37,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:37,710 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 13:35:37,711 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 13:35:37,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-03 13:35:37,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:35:37,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:35:37,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:37,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 13:35:37,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:35:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:35:37,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:35:37,893 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 13:35:37,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121655610] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:35:37,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:35:37,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2025-03-03 13:35:37,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35290789] [2025-03-03 13:35:37,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:35:37,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 13:35:37,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:37,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 13:35:37,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:35:37,894 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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 13:35:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:35:38,220 INFO L93 Difference]: Finished difference Result 138 states and 188 transitions. [2025-03-03 13:35:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:35:38,221 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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 13:35:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:35:38,222 INFO L225 Difference]: With dead ends: 138 [2025-03-03 13:35:38,222 INFO L226 Difference]: Without dead ends: 135 [2025-03-03 13:35:38,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-03 13:35:38,223 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:35:38,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 72 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:35:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-03 13:35:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 62. [2025-03-03 13:35:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 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 13:35:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2025-03-03 13:35:38,242 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 20 [2025-03-03 13:35:38,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:35:38,242 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2025-03-03 13:35:38,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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 13:35:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2025-03-03 13:35:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:35:38,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:38,243 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1] [2025-03-03 13:35:38,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 13:35:38,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:38,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:38,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:38,444 INFO L85 PathProgramCache]: Analyzing trace with hash 978001606, now seen corresponding path program 3 times [2025-03-03 13:35:38,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:38,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101535175] [2025-03-03 13:35:38,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:35:38,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:38,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 7 equivalence classes. [2025-03-03 13:35:38,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:35:38,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 13:35:38,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:35:38,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:38,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101535175] [2025-03-03 13:35:38,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101535175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:35:38,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725358577] [2025-03-03 13:35:38,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:35:38,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:38,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:38,561 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 13:35:38,563 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 13:35:38,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 7 equivalence classes. [2025-03-03 13:35:38,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:35:38,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 13:35:38,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:38,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 13:35:38,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:35:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:35:38,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:35:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:35:38,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725358577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:35:38,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:35:38,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2025-03-03 13:35:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411561382] [2025-03-03 13:35:38,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:35:38,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 13:35:38,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:38,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 13:35:38,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:35:38,811 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 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 13:35:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:35:39,218 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2025-03-03 13:35:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 13:35:39,219 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 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 23 [2025-03-03 13:35:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:35:39,219 INFO L225 Difference]: With dead ends: 100 [2025-03-03 13:35:39,219 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 13:35:39,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:35:39,220 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:35:39,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 27 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:35:39,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 13:35:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-03 13:35:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 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 13:35:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2025-03-03 13:35:39,231 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 23 [2025-03-03 13:35:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:35:39,231 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2025-03-03 13:35:39,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 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 13:35:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2025-03-03 13:35:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 13:35:39,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:39,232 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1] [2025-03-03 13:35:39,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 13:35:39,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:39,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:39,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:39,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1802797478, now seen corresponding path program 4 times [2025-03-03 13:35:39,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:39,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387921448] [2025-03-03 13:35:39,433 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:35:39,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:39,438 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-03 13:35:39,451 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 13:35:39,451 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:35:39,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 27 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:35:39,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:39,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387921448] [2025-03-03 13:35:39,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387921448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:35:39,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415467071] [2025-03-03 13:35:39,713 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:35:39,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:39,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:39,715 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 13:35:39,717 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 13:35:39,740 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-03 13:35:39,755 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 13:35:39,756 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:35:39,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:39,759 WARN L254 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-03 13:35:39,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:35:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:35:40,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:35:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 285 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:35:40,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415467071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:35:40,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:35:40,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 29, 17] total 57 [2025-03-03 13:35:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079652053] [2025-03-03 13:35:40,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:35:40,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-03 13:35:40,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:40,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-03 13:35:40,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=2658, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 13:35:40,832 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 57 states, 57 states have (on average 2.3684210526315788) internal successors, (135), 57 states have internal predecessors, (135), 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 13:35:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:35:48,444 INFO L93 Difference]: Finished difference Result 531 states and 730 transitions. [2025-03-03 13:35:48,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2025-03-03 13:35:48,445 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.3684210526315788) internal successors, (135), 57 states have internal predecessors, (135), 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 47 [2025-03-03 13:35:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:35:48,447 INFO L225 Difference]: With dead ends: 531 [2025-03-03 13:35:48,447 INFO L226 Difference]: Without dead ends: 522 [2025-03-03 13:35:48,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7784 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=5768, Invalid=17184, Unknown=0, NotChecked=0, Total=22952 [2025-03-03 13:35:48,451 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:35:48,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 127 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 13:35:48,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-03 13:35:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 498. [2025-03-03 13:35:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.3722334004024146) internal successors, (682), 497 states have internal predecessors, (682), 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 13:35:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 682 transitions. [2025-03-03 13:35:48,495 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 682 transitions. Word has length 47 [2025-03-03 13:35:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:35:48,495 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 682 transitions. [2025-03-03 13:35:48,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.3684210526315788) internal successors, (135), 57 states have internal predecessors, (135), 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 13:35:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 682 transitions. [2025-03-03 13:35:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 13:35:48,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:48,497 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 14, 2, 1, 1, 1, 1, 1] [2025-03-03 13:35:48,503 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 13:35:48,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:48,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:48,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:48,700 INFO L85 PathProgramCache]: Analyzing trace with hash -27749595, now seen corresponding path program 5 times [2025-03-03 13:35:48,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:48,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512011859] [2025-03-03 13:35:48,700 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:35:48,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:48,704 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 53 statements into 17 equivalence classes. [2025-03-03 13:35:48,747 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 13:35:48,748 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2025-03-03 13:35:48,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 73 proven. 301 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:35:49,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:49,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512011859] [2025-03-03 13:35:49,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512011859] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:35:49,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685156066] [2025-03-03 13:35:49,011 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:35:49,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:49,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:49,012 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 13:35:49,013 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 13:35:49,034 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 53 statements into 17 equivalence classes. [2025-03-03 13:35:49,091 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 13:35:49,091 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2025-03-03 13:35:49,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:49,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 13:35:49,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:35:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 371 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 13:35:49,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:35:49,824 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 371 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 13:35:49,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685156066] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:35:49,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:35:49,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 48 [2025-03-03 13:35:49,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464494731] [2025-03-03 13:35:49,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:35:49,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 13:35:49,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:49,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 13:35:49,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1927, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 13:35:49,826 INFO L87 Difference]: Start difference. First operand 498 states and 682 transitions. Second operand has 48 states, 48 states have (on average 3.0625) internal successors, (147), 48 states have internal predecessors, (147), 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 13:36:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:36:00,635 INFO L93 Difference]: Finished difference Result 1471 states and 2051 transitions. [2025-03-03 13:36:00,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2025-03-03 13:36:00,636 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.0625) internal successors, (147), 48 states have internal predecessors, (147), 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 53 [2025-03-03 13:36:00,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:36:00,639 INFO L225 Difference]: With dead ends: 1471 [2025-03-03 13:36:00,639 INFO L226 Difference]: Without dead ends: 1018 [2025-03-03 13:36:00,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12005 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=8622, Invalid=24684, Unknown=0, NotChecked=0, Total=33306 [2025-03-03 13:36:00,645 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 623 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:36:00,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 118 Invalid, 1991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 13:36:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-03-03 13:36:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 548. [2025-03-03 13:36:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.3674588665447898) internal successors, (748), 547 states have internal predecessors, (748), 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 13:36:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 748 transitions. [2025-03-03 13:36:00,702 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 748 transitions. Word has length 53 [2025-03-03 13:36:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:36:00,702 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 748 transitions. [2025-03-03 13:36:00,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.0625) internal successors, (147), 48 states have internal predecessors, (147), 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 13:36:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 748 transitions. [2025-03-03 13:36:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 13:36:00,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:36:00,703 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 15, 3, 1, 1, 1, 1, 1] [2025-03-03 13:36:00,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 13:36:00,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:36:00,904 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:36:00,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:36:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash 292172422, now seen corresponding path program 6 times [2025-03-03 13:36:00,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:36:00,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414502313] [2025-03-03 13:36:00,904 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:36:00,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:36:00,908 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 19 equivalence classes. [2025-03-03 13:36:00,921 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 41 of 59 statements. [2025-03-03 13:36:00,921 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-03 13:36:00,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 161 proven. 15 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-03-03 13:36:01,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:36:01,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414502313] [2025-03-03 13:36:01,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414502313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:36:01,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566454784] [2025-03-03 13:36:01,044 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:36:01,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:36:01,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:36:01,046 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 13:36:01,048 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 13:36:01,067 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 59 statements into 19 equivalence classes. [2025-03-03 13:36:01,094 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 41 of 59 statements. [2025-03-03 13:36:01,094 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-03 13:36:01,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:01,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 13:36:01,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:36:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 161 proven. 15 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-03-03 13:36:01,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:36:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 161 proven. 15 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-03-03 13:36:01,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566454784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:36:01,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:36:01,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-03 13:36:01,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393865578] [2025-03-03 13:36:01,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:36:01,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:36:01,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:36:01,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:36:01,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:36:01,212 INFO L87 Difference]: Start difference. First operand 548 states and 748 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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 13:36:05,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 13:36:09,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 13:36:13,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 13:36:15,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 13:36:19,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 13:36:23,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 13:36:27,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 13:36:31,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 13:36:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:36:31,687 INFO L93 Difference]: Finished difference Result 3132 states and 4712 transitions. [2025-03-03 13:36:31,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 13:36:31,687 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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 59 [2025-03-03 13:36:31,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:36:31,695 INFO L225 Difference]: With dead ends: 3132 [2025-03-03 13:36:31,695 INFO L226 Difference]: Without dead ends: 3129 [2025-03-03 13:36:31,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=384, Unknown=0, NotChecked=0, Total=650 [2025-03-03 13:36:31,698 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:36:31,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 26 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 7 Unknown, 0 Unchecked, 30.0s Time] [2025-03-03 13:36:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2025-03-03 13:36:31,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 78. [2025-03-03 13:36:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.12987012987013) internal successors, (87), 77 states have internal predecessors, (87), 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 13:36:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2025-03-03 13:36:31,730 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 59 [2025-03-03 13:36:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:36:31,731 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2025-03-03 13:36:31,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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 13:36:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2025-03-03 13:36:31,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 13:36:31,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:36:31,733 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 15, 9, 1, 1, 1, 1, 1] [2025-03-03 13:36:31,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 13:36:31,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:36:31,934 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:36:31,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:36:31,934 INFO L85 PathProgramCache]: Analyzing trace with hash -59410618, now seen corresponding path program 7 times [2025-03-03 13:36:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:36:31,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981678482] [2025-03-03 13:36:31,935 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:36:31,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:36:31,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 13:36:31,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 13:36:31,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:36:31,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 407 proven. 345 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 13:36:32,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:36:32,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981678482] [2025-03-03 13:36:32,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981678482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:36:32,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229125933] [2025-03-03 13:36:32,239 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:36:32,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:36:32,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:36:32,241 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 13:36:32,242 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 13:36:32,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 13:36:32,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 13:36:32,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:36:32,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:32,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-03 13:36:32,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:36:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 827 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 13:36:32,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:36:33,488 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 826 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 13:36:33,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229125933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:36:33,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:36:33,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 19] total 57 [2025-03-03 13:36:33,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944000085] [2025-03-03 13:36:33,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:36:33,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-03 13:36:33,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:36:33,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-03 13:36:33,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=2705, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 13:36:33,489 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 57 states, 57 states have (on average 3.0) internal successors, (171), 57 states have internal predecessors, (171), 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 13:36:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:36:52,304 INFO L93 Difference]: Finished difference Result 2321 states and 3085 transitions. [2025-03-03 13:36:52,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2025-03-03 13:36:52,304 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.0) internal successors, (171), 57 states have internal predecessors, (171), 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 77 [2025-03-03 13:36:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:36:52,313 INFO L225 Difference]: With dead ends: 2321 [2025-03-03 13:36:52,313 INFO L226 Difference]: Without dead ends: 2288 [2025-03-03 13:36:52,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13974 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=8783, Invalid=29829, Unknown=0, NotChecked=0, Total=38612 [2025-03-03 13:36:52,315 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:36:52,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 13:36:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2025-03-03 13:36:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2001. [2025-03-03 13:36:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2001 states, 2000 states have (on average 1.3285) internal successors, (2657), 2000 states have internal predecessors, (2657), 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 13:36:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2657 transitions. [2025-03-03 13:36:53,340 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2657 transitions. Word has length 77 [2025-03-03 13:36:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:36:53,341 INFO L471 AbstractCegarLoop]: Abstraction has 2001 states and 2657 transitions. [2025-03-03 13:36:53,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.0) internal successors, (171), 57 states have internal predecessors, (171), 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 13:36:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2657 transitions. [2025-03-03 13:36:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 13:36:53,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:36:53,342 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 16, 10, 1, 1, 1, 1, 1] [2025-03-03 13:36:53,347 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 13:36:53,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 13:36:53,542 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:36:53,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:36:53,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1677640645, now seen corresponding path program 8 times [2025-03-03 13:36:53,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:36:53,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131836630] [2025-03-03 13:36:53,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:36:53,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:36:53,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-03 13:36:53,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 13:36:53,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:36:53,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 974 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 13:36:54,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:36:54,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131836630] [2025-03-03 13:36:54,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131836630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:36:54,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262772422] [2025-03-03 13:36:54,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:36:54,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:36:54,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:36:54,038 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 13:36:54,039 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 13:36:54,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-03 13:36:54,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 13:36:54,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:36:54,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:54,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-03 13:36:54,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:36:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 972 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 13:36:54,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:36:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 972 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 13:36:54,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262772422] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:36:54,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:36:54,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 39 [2025-03-03 13:36:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339931627] [2025-03-03 13:36:54,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:36:54,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 13:36:54,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:36:54,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 13:36:54,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1111, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 13:36:54,727 INFO L87 Difference]: Start difference. First operand 2001 states and 2657 transitions. Second operand has 39 states, 39 states have (on average 3.3076923076923075) internal successors, (129), 39 states have internal predecessors, (129), 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)