./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_9.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/locks/test_locks_9.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 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:45:35,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:45:35,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:45:35,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:45:35,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:45:35,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:45:35,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:45:35,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:45:35,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:45:35,250 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:45:35,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:45:35,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:45:35,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:45:35,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:45:35,251 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:45:35,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:45:35,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:45:35,252 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:45:35,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:45:35,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:45:35,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:45:35,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:45:35,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:45:35,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:45:35,253 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:45:35,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:45:35,253 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:45:35,253 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:45:35,253 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:45:35,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:45:35,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:45:35,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:45:35,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:45:35,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:45:35,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:45:35,254 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:45:35,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:45:35,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:45:35,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:45:35,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:45:35,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:45:35,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:45:35,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:45:35,255 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 -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2025-03-03 09:45:35,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:45:35,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:45:35,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:45:35,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:45:35,462 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:45:35,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2025-03-03 09:45:36,602 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b07c5cb3e/996601deddb34038988a2349bfb0bd57/FLAGe35db743e [2025-03-03 09:45:36,835 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:45:36,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2025-03-03 09:45:36,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b07c5cb3e/996601deddb34038988a2349bfb0bd57/FLAGe35db743e [2025-03-03 09:45:37,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b07c5cb3e/996601deddb34038988a2349bfb0bd57 [2025-03-03 09:45:37,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:45:37,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:45:37,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:45:37,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:45:37,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:45:37,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:45:37" (1/1) ... [2025-03-03 09:45:37,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b05a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37, skipping insertion in model container [2025-03-03 09:45:37,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:45:37" (1/1) ... [2025-03-03 09:45:37,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:45:37,289 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/locks/test_locks_9.c[3555,3568] [2025-03-03 09:45:37,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:45:37,298 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:45:37,311 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/locks/test_locks_9.c[3555,3568] [2025-03-03 09:45:37,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:45:37,325 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:45:37,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37 WrapperNode [2025-03-03 09:45:37,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:45:37,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:45:37,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:45:37,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:45:37,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37" (1/1) ... [2025-03-03 09:45:37,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37" (1/1) ... [2025-03-03 09:45:37,350 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 133 [2025-03-03 09:45:37,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:45:37,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:45:37,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:45:37,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:45:37,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37" (1/1) ... [2025-03-03 09:45:37,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37" (1/1) ... [2025-03-03 09:45:37,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37" (1/1) ... [2025-03-03 09:45:37,370 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 09:45:37,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37" (1/1) ... [2025-03-03 09:45:37,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37" (1/1) ... [2025-03-03 09:45:37,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37" (1/1) ... [2025-03-03 09:45:37,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37" (1/1) ... [2025-03-03 09:45:37,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37" (1/1) ... [2025-03-03 09:45:37,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37" (1/1) ... [2025-03-03 09:45:37,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:45:37,378 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:45:37,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:45:37,378 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:45:37,383 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37" (1/1) ... [2025-03-03 09:45:37,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:45:37,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:45:37,407 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 09:45:37,410 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 09:45:37,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:45:37,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:45:37,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:45:37,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:45:37,471 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:45:37,472 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:45:37,619 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 09:45:37,619 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:45:37,626 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:45:37,626 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:45:37,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:45:37 BoogieIcfgContainer [2025-03-03 09:45:37,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:45:37,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:45:37,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:45:37,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:45:37,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:45:37" (1/3) ... [2025-03-03 09:45:37,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52389cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:45:37, skipping insertion in model container [2025-03-03 09:45:37,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:37" (2/3) ... [2025-03-03 09:45:37,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52389cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:45:37, skipping insertion in model container [2025-03-03 09:45:37,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:45:37" (3/3) ... [2025-03-03 09:45:37,633 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2025-03-03 09:45:37,642 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:45:37,643 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_9.c that has 1 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:45:37,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:45:37,686 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;@67e43434, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:45:37,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:45:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 36 states have internal predecessors, (65), 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 09:45:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:45:37,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:37,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:37,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:37,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1406280967, now seen corresponding path program 1 times [2025-03-03 09:45:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:37,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971641327] [2025-03-03 09:45:37,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:37,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:37,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:45:37,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:45:37,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:37,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:37,837 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 09:45:37,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:37,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971641327] [2025-03-03 09:45:37,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971641327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:37,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:37,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:37,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790500843] [2025-03-03 09:45:37,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:37,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:37,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:37,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:37,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:37,856 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 36 states have internal predecessors, (65), 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 5.333333333333333) internal successors, (16), 3 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 09:45:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:37,884 INFO L93 Difference]: Finished difference Result 75 states and 130 transitions. [2025-03-03 09:45:37,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:37,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Word has length 16 [2025-03-03 09:45:37,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:37,890 INFO L225 Difference]: With dead ends: 75 [2025-03-03 09:45:37,890 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 09:45:37,892 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 09:45:37,894 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:37,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 125 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 09:45:37,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2025-03-03 09:45:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 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 09:45:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2025-03-03 09:45:37,913 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2025-03-03 09:45:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:37,914 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2025-03-03 09:45:37,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 09:45:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2025-03-03 09:45:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:45:37,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:37,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:37,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:45:37,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:37,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:37,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1277198248, now seen corresponding path program 1 times [2025-03-03 09:45:37,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:37,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387148786] [2025-03-03 09:45:37,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:37,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:37,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:45:37,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:45:37,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:37,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:37,972 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 09:45:37,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:37,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387148786] [2025-03-03 09:45:37,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387148786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:37,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:37,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:37,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074851519] [2025-03-03 09:45:37,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:37,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:37,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:37,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:37,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:37,975 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 09:45:37,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:37,994 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2025-03-03 09:45:37,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:37,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) Word has length 16 [2025-03-03 09:45:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:37,996 INFO L225 Difference]: With dead ends: 104 [2025-03-03 09:45:37,997 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 09:45:37,997 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 09:45:37,998 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:37,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:37,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 09:45:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-03 09:45:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 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 09:45:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2025-03-03 09:45:38,005 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2025-03-03 09:45:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,006 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2025-03-03 09:45:38,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 09:45:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2025-03-03 09:45:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:45:38,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:45:38,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash -645009393, now seen corresponding path program 1 times [2025-03-03 09:45:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969088309] [2025-03-03 09:45:38,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:45:38,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:45:38,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,066 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 09:45:38,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969088309] [2025-03-03 09:45:38,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969088309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886012680] [2025-03-03 09:45:38,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,067 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 09:45:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:38,083 INFO L93 Difference]: Finished difference Result 96 states and 168 transitions. [2025-03-03 09:45:38,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:38,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2025-03-03 09:45:38,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:38,083 INFO L225 Difference]: With dead ends: 96 [2025-03-03 09:45:38,083 INFO L226 Difference]: Without dead ends: 66 [2025-03-03 09:45:38,084 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 09:45:38,084 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:38,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-03 09:45:38,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2025-03-03 09:45:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 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 09:45:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2025-03-03 09:45:38,088 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2025-03-03 09:45:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,089 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2025-03-03 09:45:38,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 09:45:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2025-03-03 09:45:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:45:38,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:45:38,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash -938412400, now seen corresponding path program 1 times [2025-03-03 09:45:38,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647863183] [2025-03-03 09:45:38,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:45:38,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:45:38,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,134 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 09:45:38,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647863183] [2025-03-03 09:45:38,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647863183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673892746] [2025-03-03 09:45:38,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,135 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 09:45:38,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:38,155 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2025-03-03 09:45:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:38,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2025-03-03 09:45:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:38,156 INFO L225 Difference]: With dead ends: 121 [2025-03-03 09:45:38,156 INFO L226 Difference]: Without dead ends: 119 [2025-03-03 09:45:38,157 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 09:45:38,157 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:38,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-03 09:45:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2025-03-03 09:45:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 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 09:45:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2025-03-03 09:45:38,166 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2025-03-03 09:45:38,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,166 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2025-03-03 09:45:38,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 09:45:38,166 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2025-03-03 09:45:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:45:38,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:45:38,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash -809329681, now seen corresponding path program 1 times [2025-03-03 09:45:38,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888933535] [2025-03-03 09:45:38,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:45:38,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:45:38,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,212 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 09:45:38,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888933535] [2025-03-03 09:45:38,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888933535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251928638] [2025-03-03 09:45:38,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,214 INFO L87 Difference]: Start difference. First operand 85 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 09:45:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:38,231 INFO L93 Difference]: Finished difference Result 201 states and 355 transitions. [2025-03-03 09:45:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:38,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2025-03-03 09:45:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:38,232 INFO L225 Difference]: With dead ends: 201 [2025-03-03 09:45:38,232 INFO L226 Difference]: Without dead ends: 121 [2025-03-03 09:45:38,233 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 09:45:38,233 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:38,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-03 09:45:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-03-03 09:45:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 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 09:45:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2025-03-03 09:45:38,247 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2025-03-03 09:45:38,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,248 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2025-03-03 09:45:38,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 09:45:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2025-03-03 09:45:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 09:45:38,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:45:38,249 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,250 INFO L85 PathProgramCache]: Analyzing trace with hash 974014079, now seen corresponding path program 1 times [2025-03-03 09:45:38,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77721518] [2025-03-03 09:45:38,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:45:38,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:45:38,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,270 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 09:45:38,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77721518] [2025-03-03 09:45:38,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77721518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271335369] [2025-03-03 09:45:38,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,271 INFO L87 Difference]: Start difference. First operand 119 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 09:45:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:38,281 INFO L93 Difference]: Finished difference Result 180 states and 310 transitions. [2025-03-03 09:45:38,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:38,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2025-03-03 09:45:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:38,282 INFO L225 Difference]: With dead ends: 180 [2025-03-03 09:45:38,282 INFO L226 Difference]: Without dead ends: 123 [2025-03-03 09:45:38,283 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 09:45:38,285 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 44 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:38,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:38,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-03 09:45:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2025-03-03 09:45:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 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 09:45:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2025-03-03 09:45:38,296 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2025-03-03 09:45:38,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,296 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2025-03-03 09:45:38,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 09:45:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2025-03-03 09:45:38,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 09:45:38,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:45:38,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,297 INFO L85 PathProgramCache]: Analyzing trace with hash 680611072, now seen corresponding path program 1 times [2025-03-03 09:45:38,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446382510] [2025-03-03 09:45:38,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:45:38,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:45:38,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,330 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 09:45:38,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446382510] [2025-03-03 09:45:38,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446382510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137150957] [2025-03-03 09:45:38,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,331 INFO L87 Difference]: Start difference. First operand 121 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 09:45:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:38,341 INFO L93 Difference]: Finished difference Result 225 states and 389 transitions. [2025-03-03 09:45:38,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:38,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2025-03-03 09:45:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:38,342 INFO L225 Difference]: With dead ends: 225 [2025-03-03 09:45:38,342 INFO L226 Difference]: Without dead ends: 223 [2025-03-03 09:45:38,343 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 09:45:38,343 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:38,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-03 09:45:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 165. [2025-03-03 09:45:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.701219512195122) internal successors, (279), 164 states have internal predecessors, (279), 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 09:45:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 279 transitions. [2025-03-03 09:45:38,351 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 279 transitions. Word has length 18 [2025-03-03 09:45:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,351 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 279 transitions. [2025-03-03 09:45:38,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 09:45:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 279 transitions. [2025-03-03 09:45:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 09:45:38,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:45:38,354 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,354 INFO L85 PathProgramCache]: Analyzing trace with hash 809693791, now seen corresponding path program 1 times [2025-03-03 09:45:38,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658488453] [2025-03-03 09:45:38,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:45:38,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:45:38,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,372 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 09:45:38,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658488453] [2025-03-03 09:45:38,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658488453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554869510] [2025-03-03 09:45:38,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,373 INFO L87 Difference]: Start difference. First operand 165 states and 279 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 09:45:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:38,385 INFO L93 Difference]: Finished difference Result 389 states and 661 transitions. [2025-03-03 09:45:38,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:38,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2025-03-03 09:45:38,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:38,386 INFO L225 Difference]: With dead ends: 389 [2025-03-03 09:45:38,386 INFO L226 Difference]: Without dead ends: 231 [2025-03-03 09:45:38,386 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 09:45:38,387 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:38,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-03 09:45:38,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2025-03-03 09:45:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 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 09:45:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2025-03-03 09:45:38,399 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2025-03-03 09:45:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,399 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2025-03-03 09:45:38,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 09:45:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2025-03-03 09:45:38,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 09:45:38,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:45:38,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,401 INFO L85 PathProgramCache]: Analyzing trace with hash -375866058, now seen corresponding path program 1 times [2025-03-03 09:45:38,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557319366] [2025-03-03 09:45:38,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 09:45:38,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:45:38,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,432 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 09:45:38,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557319366] [2025-03-03 09:45:38,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557319366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746945556] [2025-03-03 09:45:38,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,433 INFO L87 Difference]: Start difference. First operand 229 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 09:45:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:38,444 INFO L93 Difference]: Finished difference Result 345 states and 573 transitions. [2025-03-03 09:45:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:38,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2025-03-03 09:45:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:38,445 INFO L225 Difference]: With dead ends: 345 [2025-03-03 09:45:38,445 INFO L226 Difference]: Without dead ends: 235 [2025-03-03 09:45:38,446 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 09:45:38,446 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 43 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:38,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:38,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-03 09:45:38,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2025-03-03 09:45:38,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.6508620689655173) internal successors, (383), 232 states have internal predecessors, (383), 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 09:45:38,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 383 transitions. [2025-03-03 09:45:38,452 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 383 transitions. Word has length 19 [2025-03-03 09:45:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,452 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 383 transitions. [2025-03-03 09:45:38,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 09:45:38,453 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 383 transitions. [2025-03-03 09:45:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 09:45:38,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:45:38,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,454 INFO L85 PathProgramCache]: Analyzing trace with hash -669269065, now seen corresponding path program 1 times [2025-03-03 09:45:38,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673396484] [2025-03-03 09:45:38,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 09:45:38,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:45:38,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,472 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 09:45:38,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673396484] [2025-03-03 09:45:38,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673396484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375890478] [2025-03-03 09:45:38,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,474 INFO L87 Difference]: Start difference. First operand 233 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 09:45:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:38,487 INFO L93 Difference]: Finished difference Result 669 states and 1097 transitions. [2025-03-03 09:45:38,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:38,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2025-03-03 09:45:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:38,489 INFO L225 Difference]: With dead ends: 669 [2025-03-03 09:45:38,489 INFO L226 Difference]: Without dead ends: 447 [2025-03-03 09:45:38,489 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 09:45:38,490 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:38,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-03 09:45:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2025-03-03 09:45:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.6103603603603605) internal successors, (715), 444 states have internal predecessors, (715), 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 09:45:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 715 transitions. [2025-03-03 09:45:38,500 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 715 transitions. Word has length 19 [2025-03-03 09:45:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,500 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 715 transitions. [2025-03-03 09:45:38,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 09:45:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 715 transitions. [2025-03-03 09:45:38,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 09:45:38,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:45:38,501 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash -798351784, now seen corresponding path program 1 times [2025-03-03 09:45:38,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315044762] [2025-03-03 09:45:38,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 09:45:38,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:45:38,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,517 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 09:45:38,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315044762] [2025-03-03 09:45:38,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315044762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564108460] [2025-03-03 09:45:38,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,518 INFO L87 Difference]: Start difference. First operand 445 states and 715 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 09:45:38,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:38,530 INFO L93 Difference]: Finished difference Result 545 states and 893 transitions. [2025-03-03 09:45:38,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:38,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2025-03-03 09:45:38,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:38,533 INFO L225 Difference]: With dead ends: 545 [2025-03-03 09:45:38,533 INFO L226 Difference]: Without dead ends: 543 [2025-03-03 09:45:38,533 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 09:45:38,533 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 34 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:38,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 147 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-03 09:45:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 445. [2025-03-03 09:45:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.5923423423423424) internal successors, (707), 444 states have internal predecessors, (707), 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 09:45:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 707 transitions. [2025-03-03 09:45:38,549 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 707 transitions. Word has length 19 [2025-03-03 09:45:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,549 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 707 transitions. [2025-03-03 09:45:38,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 09:45:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 707 transitions. [2025-03-03 09:45:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 09:45:38,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 09:45:38,550 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,550 INFO L85 PathProgramCache]: Analyzing trace with hash 727522438, now seen corresponding path program 1 times [2025-03-03 09:45:38,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771893842] [2025-03-03 09:45:38,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 09:45:38,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:45:38,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,576 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 09:45:38,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771893842] [2025-03-03 09:45:38,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771893842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435614996] [2025-03-03 09:45:38,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,577 INFO L87 Difference]: Start difference. First operand 445 states and 707 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 09:45:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:38,603 INFO L93 Difference]: Finished difference Result 801 states and 1293 transitions. [2025-03-03 09:45:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:38,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 20 [2025-03-03 09:45:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:38,606 INFO L225 Difference]: With dead ends: 801 [2025-03-03 09:45:38,606 INFO L226 Difference]: Without dead ends: 799 [2025-03-03 09:45:38,606 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 09:45:38,606 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:38,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-03 09:45:38,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 637. [2025-03-03 09:45:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 1.5518867924528301) internal successors, (987), 636 states have internal predecessors, (987), 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 09:45:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 987 transitions. [2025-03-03 09:45:38,620 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 987 transitions. Word has length 20 [2025-03-03 09:45:38,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,620 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 987 transitions. [2025-03-03 09:45:38,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 09:45:38,620 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 987 transitions. [2025-03-03 09:45:38,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 09:45:38,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 09:45:38,621 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,621 INFO L85 PathProgramCache]: Analyzing trace with hash 856605157, now seen corresponding path program 1 times [2025-03-03 09:45:38,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127975087] [2025-03-03 09:45:38,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 09:45:38,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:45:38,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,639 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 09:45:38,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127975087] [2025-03-03 09:45:38,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127975087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099370847] [2025-03-03 09:45:38,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,643 INFO L87 Difference]: Start difference. First operand 637 states and 987 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 09:45:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:38,663 INFO L93 Difference]: Finished difference Result 1489 states and 2317 transitions. [2025-03-03 09:45:38,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:38,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 20 [2025-03-03 09:45:38,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:38,666 INFO L225 Difference]: With dead ends: 1489 [2025-03-03 09:45:38,666 INFO L226 Difference]: Without dead ends: 863 [2025-03-03 09:45:38,666 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 09:45:38,667 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:38,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-03 09:45:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 861. [2025-03-03 09:45:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 1.5290697674418605) internal successors, (1315), 860 states have internal predecessors, (1315), 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 09:45:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1315 transitions. [2025-03-03 09:45:38,687 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1315 transitions. Word has length 20 [2025-03-03 09:45:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,688 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1315 transitions. [2025-03-03 09:45:38,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 09:45:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1315 transitions. [2025-03-03 09:45:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 09:45:38,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 09:45:38,689 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1078385854, now seen corresponding path program 1 times [2025-03-03 09:45:38,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445408145] [2025-03-03 09:45:38,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 09:45:38,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:45:38,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,711 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 09:45:38,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445408145] [2025-03-03 09:45:38,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445408145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309599762] [2025-03-03 09:45:38,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,715 INFO L87 Difference]: Start difference. First operand 861 states and 1315 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 09:45:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:38,735 INFO L93 Difference]: Finished difference Result 1305 states and 1989 transitions. [2025-03-03 09:45:38,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:38,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2025-03-03 09:45:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:38,739 INFO L225 Difference]: With dead ends: 1305 [2025-03-03 09:45:38,739 INFO L226 Difference]: Without dead ends: 887 [2025-03-03 09:45:38,740 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 09:45:38,741 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:38,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-03-03 09:45:38,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2025-03-03 09:45:38,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 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 09:45:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1331 transitions. [2025-03-03 09:45:38,763 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1331 transitions. Word has length 21 [2025-03-03 09:45:38,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,764 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1331 transitions. [2025-03-03 09:45:38,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 09:45:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1331 transitions. [2025-03-03 09:45:38,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 09:45:38,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 09:45:38,767 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,768 INFO L85 PathProgramCache]: Analyzing trace with hash 784982847, now seen corresponding path program 1 times [2025-03-03 09:45:38,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497967920] [2025-03-03 09:45:38,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 09:45:38,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:45:38,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,787 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 09:45:38,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497967920] [2025-03-03 09:45:38,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497967920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019499397] [2025-03-03 09:45:38,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,789 INFO L87 Difference]: Start difference. First operand 885 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 09:45:38,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:38,829 INFO L93 Difference]: Finished difference Result 1545 states and 2357 transitions. [2025-03-03 09:45:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:38,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2025-03-03 09:45:38,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:38,833 INFO L225 Difference]: With dead ends: 1545 [2025-03-03 09:45:38,834 INFO L226 Difference]: Without dead ends: 1543 [2025-03-03 09:45:38,835 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 09:45:38,835 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:38,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2025-03-03 09:45:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2025-03-03 09:45:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 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 09:45:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1875 transitions. [2025-03-03 09:45:38,864 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1875 transitions. Word has length 21 [2025-03-03 09:45:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,864 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1875 transitions. [2025-03-03 09:45:38,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 09:45:38,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1875 transitions. [2025-03-03 09:45:38,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 09:45:38,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 09:45:38,866 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,867 INFO L85 PathProgramCache]: Analyzing trace with hash 914065566, now seen corresponding path program 1 times [2025-03-03 09:45:38,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273440335] [2025-03-03 09:45:38,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 09:45:38,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:45:38,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,889 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 09:45:38,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273440335] [2025-03-03 09:45:38,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273440335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152245608] [2025-03-03 09:45:38,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,890 INFO L87 Difference]: Start difference. First operand 1285 states and 1875 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 09:45:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:38,923 INFO L93 Difference]: Finished difference Result 2953 states and 4309 transitions. [2025-03-03 09:45:38,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:38,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2025-03-03 09:45:38,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:38,928 INFO L225 Difference]: With dead ends: 2953 [2025-03-03 09:45:38,928 INFO L226 Difference]: Without dead ends: 1703 [2025-03-03 09:45:38,930 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 09:45:38,931 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:38,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2025-03-03 09:45:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2025-03-03 09:45:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 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 09:45:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2435 transitions. [2025-03-03 09:45:38,972 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2435 transitions. Word has length 21 [2025-03-03 09:45:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,973 INFO L471 AbstractCegarLoop]: Abstraction has 1701 states and 2435 transitions. [2025-03-03 09:45:38,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 09:45:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2435 transitions. [2025-03-03 09:45:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 09:45:38,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:38,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 09:45:38,975 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1435308980, now seen corresponding path program 1 times [2025-03-03 09:45:38,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270458399] [2025-03-03 09:45:38,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 09:45:38,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:45:38,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,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 09:45:38,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270458399] [2025-03-03 09:45:38,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270458399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669493770] [2025-03-03 09:45:38,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,994 INFO L87 Difference]: Start difference. First operand 1701 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 09:45:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:39,037 INFO L93 Difference]: Finished difference Result 2553 states and 3637 transitions. [2025-03-03 09:45:39,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:39,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-03-03 09:45:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:39,042 INFO L225 Difference]: With dead ends: 2553 [2025-03-03 09:45:39,042 INFO L226 Difference]: Without dead ends: 1735 [2025-03-03 09:45:39,043 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 09:45:39,043 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:39,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:39,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2025-03-03 09:45:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2025-03-03 09:45:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 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 09:45:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2435 transitions. [2025-03-03 09:45:39,083 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2435 transitions. Word has length 22 [2025-03-03 09:45:39,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:39,083 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2435 transitions. [2025-03-03 09:45:39,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 09:45:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2435 transitions. [2025-03-03 09:45:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 09:45:39,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:39,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:39,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 09:45:39,085 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:39,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:39,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1728711987, now seen corresponding path program 1 times [2025-03-03 09:45:39,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:39,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741806401] [2025-03-03 09:45:39,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:39,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:39,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 09:45:39,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:45:39,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:39,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:39,103 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 09:45:39,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:39,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741806401] [2025-03-03 09:45:39,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741806401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:39,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:39,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:39,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400748515] [2025-03-03 09:45:39,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:39,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:39,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:39,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:39,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:39,104 INFO L87 Difference]: Start difference. First operand 1733 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 09:45:39,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:39,149 INFO L93 Difference]: Finished difference Result 2953 states and 4197 transitions. [2025-03-03 09:45:39,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:39,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-03-03 09:45:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:39,158 INFO L225 Difference]: With dead ends: 2953 [2025-03-03 09:45:39,158 INFO L226 Difference]: Without dead ends: 2951 [2025-03-03 09:45:39,159 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 09:45:39,159 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 25 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:39,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:39,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2025-03-03 09:45:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2025-03-03 09:45:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 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 09:45:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3491 transitions. [2025-03-03 09:45:39,226 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3491 transitions. Word has length 22 [2025-03-03 09:45:39,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:39,227 INFO L471 AbstractCegarLoop]: Abstraction has 2565 states and 3491 transitions. [2025-03-03 09:45:39,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 09:45:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3491 transitions. [2025-03-03 09:45:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 09:45:39,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:39,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:39,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 09:45:39,229 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:39,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:39,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1599629268, now seen corresponding path program 1 times [2025-03-03 09:45:39,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:39,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623644504] [2025-03-03 09:45:39,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:39,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:39,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 09:45:39,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:45:39,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:39,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:39,245 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 09:45:39,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:39,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623644504] [2025-03-03 09:45:39,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623644504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:39,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:39,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:39,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528324312] [2025-03-03 09:45:39,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:39,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:39,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:39,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:39,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:39,247 INFO L87 Difference]: Start difference. First operand 2565 states and 3491 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 09:45:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:39,300 INFO L93 Difference]: Finished difference Result 5833 states and 7909 transitions. [2025-03-03 09:45:39,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:39,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-03-03 09:45:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:39,308 INFO L225 Difference]: With dead ends: 5833 [2025-03-03 09:45:39,308 INFO L226 Difference]: Without dead ends: 3335 [2025-03-03 09:45:39,311 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 09:45:39,311 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:39,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2025-03-03 09:45:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2025-03-03 09:45:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 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 09:45:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4419 transitions. [2025-03-03 09:45:39,409 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4419 transitions. Word has length 22 [2025-03-03 09:45:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:39,409 INFO L471 AbstractCegarLoop]: Abstraction has 3333 states and 4419 transitions. [2025-03-03 09:45:39,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 09:45:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4419 transitions. [2025-03-03 09:45:39,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 09:45:39,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:39,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:39,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 09:45:39,413 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:39,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:39,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2050437723, now seen corresponding path program 1 times [2025-03-03 09:45:39,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:39,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919109716] [2025-03-03 09:45:39,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:39,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:39,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 09:45:39,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 09:45:39,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:39,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:39,428 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 09:45:39,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:39,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919109716] [2025-03-03 09:45:39,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919109716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:39,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:39,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:39,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533323317] [2025-03-03 09:45:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:39,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:39,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:39,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:39,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:39,430 INFO L87 Difference]: Start difference. First operand 3333 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 09:45:39,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:39,491 INFO L93 Difference]: Finished difference Result 5001 states and 6597 transitions. [2025-03-03 09:45:39,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:39,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 09:45:39,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:39,500 INFO L225 Difference]: With dead ends: 5001 [2025-03-03 09:45:39,500 INFO L226 Difference]: Without dead ends: 3399 [2025-03-03 09:45:39,502 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 09:45:39,502 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:39,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:39,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2025-03-03 09:45:39,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2025-03-03 09:45:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 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 09:45:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4419 transitions. [2025-03-03 09:45:39,583 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4419 transitions. Word has length 23 [2025-03-03 09:45:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:39,583 INFO L471 AbstractCegarLoop]: Abstraction has 3397 states and 4419 transitions. [2025-03-03 09:45:39,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 09:45:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4419 transitions. [2025-03-03 09:45:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 09:45:39,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:39,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:39,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 09:45:39,586 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:39,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:39,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1951126566, now seen corresponding path program 1 times [2025-03-03 09:45:39,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:39,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330689394] [2025-03-03 09:45:39,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:39,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:39,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 09:45:39,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 09:45:39,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:39,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:39,599 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 09:45:39,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:39,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330689394] [2025-03-03 09:45:39,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330689394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:39,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:39,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:39,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294845059] [2025-03-03 09:45:39,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:39,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:39,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:39,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:39,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:39,600 INFO L87 Difference]: Start difference. First operand 3397 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 09:45:39,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:39,662 INFO L93 Difference]: Finished difference Result 5641 states and 7365 transitions. [2025-03-03 09:45:39,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:39,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 09:45:39,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:39,676 INFO L225 Difference]: With dead ends: 5641 [2025-03-03 09:45:39,678 INFO L226 Difference]: Without dead ends: 5639 [2025-03-03 09:45:39,680 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 09:45:39,681 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:39,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2025-03-03 09:45:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2025-03-03 09:45:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 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 09:45:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6467 transitions. [2025-03-03 09:45:39,792 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6467 transitions. Word has length 23 [2025-03-03 09:45:39,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:39,794 INFO L471 AbstractCegarLoop]: Abstraction has 5125 states and 6467 transitions. [2025-03-03 09:45:39,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 09:45:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6467 transitions. [2025-03-03 09:45:39,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 09:45:39,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:39,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:39,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 09:45:39,799 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:39,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:39,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2080209285, now seen corresponding path program 1 times [2025-03-03 09:45:39,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:39,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766293392] [2025-03-03 09:45:39,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:39,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:39,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 09:45:39,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 09:45:39,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:39,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:39,815 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 09:45:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766293392] [2025-03-03 09:45:39,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766293392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:39,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:39,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:39,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278337986] [2025-03-03 09:45:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:39,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:39,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:39,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:39,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:39,816 INFO L87 Difference]: Start difference. First operand 5125 states and 6467 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 09:45:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:39,933 INFO L93 Difference]: Finished difference Result 11529 states and 14405 transitions. [2025-03-03 09:45:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:39,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 09:45:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:39,946 INFO L225 Difference]: With dead ends: 11529 [2025-03-03 09:45:39,946 INFO L226 Difference]: Without dead ends: 6535 [2025-03-03 09:45:39,950 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 09:45:39,951 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:39,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2025-03-03 09:45:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2025-03-03 09:45:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 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 09:45:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7939 transitions. [2025-03-03 09:45:40,116 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7939 transitions. Word has length 23 [2025-03-03 09:45:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:40,117 INFO L471 AbstractCegarLoop]: Abstraction has 6533 states and 7939 transitions. [2025-03-03 09:45:40,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 09:45:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7939 transitions. [2025-03-03 09:45:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:45:40,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:40,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:40,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 09:45:40,123 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:40,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash 355407507, now seen corresponding path program 1 times [2025-03-03 09:45:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:40,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966811971] [2025-03-03 09:45:40,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:40,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:40,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:45:40,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:45:40,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:40,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:40,141 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 09:45:40,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:40,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966811971] [2025-03-03 09:45:40,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966811971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:40,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:40,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:40,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920018524] [2025-03-03 09:45:40,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:40,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:40,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:40,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:40,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:40,143 INFO L87 Difference]: Start difference. First operand 6533 states and 7939 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:40,260 INFO L93 Difference]: Finished difference Result 9801 states and 11845 transitions. [2025-03-03 09:45:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:40,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 09:45:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:40,275 INFO L225 Difference]: With dead ends: 9801 [2025-03-03 09:45:40,275 INFO L226 Difference]: Without dead ends: 6663 [2025-03-03 09:45:40,280 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 09:45:40,280 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:40,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:40,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2025-03-03 09:45:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2025-03-03 09:45:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 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 09:45:40,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7939 transitions. [2025-03-03 09:45:40,470 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7939 transitions. Word has length 24 [2025-03-03 09:45:40,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:40,470 INFO L471 AbstractCegarLoop]: Abstraction has 6661 states and 7939 transitions. [2025-03-03 09:45:40,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7939 transitions. [2025-03-03 09:45:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:45:40,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:40,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:40,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 09:45:40,479 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:40,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:40,480 INFO L85 PathProgramCache]: Analyzing trace with hash 62004500, now seen corresponding path program 1 times [2025-03-03 09:45:40,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:40,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123774850] [2025-03-03 09:45:40,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:40,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:40,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:45:40,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:45:40,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:40,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:40,492 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 09:45:40,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:40,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123774850] [2025-03-03 09:45:40,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123774850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:40,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:40,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:40,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440498664] [2025-03-03 09:45:40,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:40,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:40,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:40,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:40,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:40,494 INFO L87 Difference]: Start difference. First operand 6661 states and 7939 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:40,583 INFO L93 Difference]: Finished difference Result 10759 states and 12676 transitions. [2025-03-03 09:45:40,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:40,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 09:45:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:40,598 INFO L225 Difference]: With dead ends: 10759 [2025-03-03 09:45:40,598 INFO L226 Difference]: Without dead ends: 10757 [2025-03-03 09:45:40,601 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 09:45:40,602 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:40,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2025-03-03 09:45:40,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2025-03-03 09:45:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 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 09:45:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11907 transitions. [2025-03-03 09:45:40,773 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11907 transitions. Word has length 24 [2025-03-03 09:45:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:40,773 INFO L471 AbstractCegarLoop]: Abstraction has 10245 states and 11907 transitions. [2025-03-03 09:45:40,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11907 transitions. [2025-03-03 09:45:40,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:45:40,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:40,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:40,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 09:45:40,781 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:40,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:40,781 INFO L85 PathProgramCache]: Analyzing trace with hash 191087219, now seen corresponding path program 1 times [2025-03-03 09:45:40,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:40,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256108719] [2025-03-03 09:45:40,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:40,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:40,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:45:40,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:45:40,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:40,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:40,799 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 09:45:40,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:40,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256108719] [2025-03-03 09:45:40,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256108719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:40,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:40,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948828213] [2025-03-03 09:45:40,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:40,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:40,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:40,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:40,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:40,801 INFO L87 Difference]: Start difference. First operand 10245 states and 11907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:40,934 INFO L93 Difference]: Finished difference Result 22789 states and 25987 transitions. [2025-03-03 09:45:40,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:40,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 09:45:40,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:40,936 INFO L225 Difference]: With dead ends: 22789 [2025-03-03 09:45:40,936 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 09:45:40,948 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 09:45:40,949 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:40,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 09:45:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 09:45:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 09:45:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 09:45:40,951 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2025-03-03 09:45:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:40,951 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 09:45:40,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 09:45:40,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 09:45:40,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:45:40,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 09:45:40,957 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:40,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 09:45:40,966 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:45:40,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:45:40 BoogieIcfgContainer [2025-03-03 09:45:40,972 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:45:40,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:45:40,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:45:40,973 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:45:40,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:45:37" (3/4) ... [2025-03-03 09:45:40,975 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 09:45:40,982 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-03 09:45:40,982 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 09:45:40,982 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 09:45:40,982 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 09:45:41,047 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 09:45:41,047 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 09:45:41,047 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:45:41,048 INFO L158 Benchmark]: Toolchain (without parser) took 3873.17ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 112.4MB in the beginning and 186.8MB in the end (delta: -74.4MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB. [2025-03-03 09:45:41,050 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:45:41,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.03ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 100.7MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:45:41,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.74ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:45:41,050 INFO L158 Benchmark]: Boogie Preprocessor took 27.03ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 98.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:45:41,050 INFO L158 Benchmark]: IcfgBuilder took 248.16ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 83.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 09:45:41,050 INFO L158 Benchmark]: TraceAbstraction took 3344.42ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 82.7MB in the beginning and 195.2MB in the end (delta: -112.5MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2025-03-03 09:45:41,050 INFO L158 Benchmark]: Witness Printer took 74.19ms. Allocated memory is still 352.3MB. Free memory was 195.2MB in the beginning and 186.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:45:41,051 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 151.03ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 100.7MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.74ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.03ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 98.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 248.16ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 83.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3344.42ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 82.7MB in the beginning and 195.2MB in the end (delta: -112.5MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. * Witness Printer took 74.19ms. Allocated memory is still 352.3MB. Free memory was 195.2MB in the beginning and 186.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 921 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 921 mSDsluCounter, 3096 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1232 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 135 IncrementalHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1864 mSDtfsCounter, 135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10245occurred in iteration=24, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 1010 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-03 09:45:41,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE