./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_15-2.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 ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:02:00,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:02:00,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:02:00,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:02:00,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:02:00,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:02:00,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:02:00,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:02:00,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:02:00,882 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:02:00,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:02:00,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:02:00,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:02:00,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:02:00,888 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:02:00,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:02:00,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:02:00,888 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:02:00,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:02:00,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:02:00,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:02:00,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:02:00,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:02:00,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:02:00,891 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:02:00,891 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:02:00,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:02:00,891 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:02:00,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:02:00,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:02:00,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:02:00,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:02:00,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:02:00,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:02:00,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:02:00,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:02:00,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:02:00,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:02:00,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:02:00,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:02:00,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:02:00,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:02:00,895 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2024-11-11 16:02:01,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:02:01,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:02:01,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:02:01,201 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:02:01,202 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:02:01,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-2.c [2024-11-11 16:02:02,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:02:02,756 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:02:02,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2024-11-11 16:02:02,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138a8941d/35e6810b02274748a7434f4987c26f05/FLAGf8741b8de [2024-11-11 16:02:02,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138a8941d/35e6810b02274748a7434f4987c26f05 [2024-11-11 16:02:02,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:02:02,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:02:02,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:02:02,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:02:02,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:02:02,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:02:02" (1/1) ... [2024-11-11 16:02:02,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4edeab01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:02, skipping insertion in model container [2024-11-11 16:02:02,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:02:02" (1/1) ... [2024-11-11 16:02:02,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:02:03,012 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_15-2.c[5628,5641] [2024-11-11 16:02:03,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:02:03,025 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:02:03,050 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_15-2.c[5628,5641] [2024-11-11 16:02:03,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:02:03,070 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:02:03,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:03 WrapperNode [2024-11-11 16:02:03,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:02:03,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:02:03,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:02:03,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:02:03,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:03" (1/1) ... [2024-11-11 16:02:03,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:03" (1/1) ... [2024-11-11 16:02:03,106 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 208 [2024-11-11 16:02:03,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:02:03,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:02:03,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:02:03,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:02:03,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:03" (1/1) ... [2024-11-11 16:02:03,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:03" (1/1) ... [2024-11-11 16:02:03,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:03" (1/1) ... [2024-11-11 16:02:03,133 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]. [2024-11-11 16:02:03,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:03" (1/1) ... [2024-11-11 16:02:03,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:03" (1/1) ... [2024-11-11 16:02:03,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:03" (1/1) ... [2024-11-11 16:02:03,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:03" (1/1) ... [2024-11-11 16:02:03,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:03" (1/1) ... [2024-11-11 16:02:03,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:03" (1/1) ... [2024-11-11 16:02:03,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:02:03,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:02:03,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:02:03,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:02:03,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:03" (1/1) ... [2024-11-11 16:02:03,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:02:03,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:02:03,189 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) [2024-11-11 16:02:03,196 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 [2024-11-11 16:02:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:02:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:02:03,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:02:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:02:03,331 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:02:03,335 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:02:03,663 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-11 16:02:03,667 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:02:03,682 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:02:03,683 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:02:03,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:02:03 BoogieIcfgContainer [2024-11-11 16:02:03,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:02:03,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:02:03,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:02:03,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:02:03,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:02:02" (1/3) ... [2024-11-11 16:02:03,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4581599e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:02:03, skipping insertion in model container [2024-11-11 16:02:03,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:02:03" (2/3) ... [2024-11-11 16:02:03,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4581599e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:02:03, skipping insertion in model container [2024-11-11 16:02:03,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:02:03" (3/3) ... [2024-11-11 16:02:03,694 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2024-11-11 16:02:03,711 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:02:03,711 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:02:03,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:02:03,784 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;@3086a914, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:02:03,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:02:03,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 54 states have internal predecessors, (102), 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) [2024-11-11 16:02:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 16:02:03,795 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:03,796 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] [2024-11-11 16:02:03,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:03,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:03,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1188560455, now seen corresponding path program 1 times [2024-11-11 16:02:03,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:03,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128164090] [2024-11-11 16:02:03,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:03,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:04,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:04,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128164090] [2024-11-11 16:02:04,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128164090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:04,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:04,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:04,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151618393] [2024-11-11 16:02:04,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:04,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:04,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:04,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:04,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:04,065 INFO L87 Difference]: Start difference. First operand has 55 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 54 states have internal predecessors, (102), 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 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) [2024-11-11 16:02:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:04,119 INFO L93 Difference]: Finished difference Result 111 states and 204 transitions. [2024-11-11 16:02:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:04,122 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 [2024-11-11 16:02:04,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:04,132 INFO L225 Difference]: With dead ends: 111 [2024-11-11 16:02:04,132 INFO L226 Difference]: Without dead ends: 99 [2024-11-11 16:02:04,135 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 [2024-11-11 16:02:04,138 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 75 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 197 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 [2024-11-11 16:02:04,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 197 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:04,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-11 16:02:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 67. [2024-11-11 16:02:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 66 states have internal predecessors, (126), 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) [2024-11-11 16:02:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 126 transitions. [2024-11-11 16:02:04,177 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 126 transitions. Word has length 22 [2024-11-11 16:02:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:04,178 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 126 transitions. [2024-11-11 16:02:04,178 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) [2024-11-11 16:02:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 126 transitions. [2024-11-11 16:02:04,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 16:02:04,179 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:04,179 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] [2024-11-11 16:02:04,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:02:04,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:04,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1112262135, now seen corresponding path program 1 times [2024-11-11 16:02:04,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:04,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970747118] [2024-11-11 16:02:04,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:04,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:04,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:04,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970747118] [2024-11-11 16:02:04,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970747118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:04,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:04,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:04,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315177599] [2024-11-11 16:02:04,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:04,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:04,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:04,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:04,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:04,259 INFO L87 Difference]: Start difference. First operand 67 states and 126 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) [2024-11-11 16:02:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:04,288 INFO L93 Difference]: Finished difference Result 164 states and 309 transitions. [2024-11-11 16:02:04,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:04,288 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 [2024-11-11 16:02:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:04,290 INFO L225 Difference]: With dead ends: 164 [2024-11-11 16:02:04,302 INFO L226 Difference]: Without dead ends: 99 [2024-11-11 16:02:04,303 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 [2024-11-11 16:02:04,304 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 73 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 213 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 [2024-11-11 16:02:04,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:04,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-11 16:02:04,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-11 16:02:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.8958333333333333) internal successors, (182), 96 states have internal predecessors, (182), 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) [2024-11-11 16:02:04,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 182 transitions. [2024-11-11 16:02:04,321 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 182 transitions. Word has length 22 [2024-11-11 16:02:04,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:04,321 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 182 transitions. [2024-11-11 16:02:04,321 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) [2024-11-11 16:02:04,321 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 182 transitions. [2024-11-11 16:02:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-11 16:02:04,322 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:04,322 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] [2024-11-11 16:02:04,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:02:04,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:04,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:04,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1809543287, now seen corresponding path program 1 times [2024-11-11 16:02:04,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:04,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90156876] [2024-11-11 16:02:04,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:04,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:04,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:04,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90156876] [2024-11-11 16:02:04,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90156876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:04,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:04,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:04,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006582872] [2024-11-11 16:02:04,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:04,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:04,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:04,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:04,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:04,445 INFO L87 Difference]: Start difference. First operand 97 states and 182 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) [2024-11-11 16:02:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:04,475 INFO L93 Difference]: Finished difference Result 150 states and 276 transitions. [2024-11-11 16:02:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:04,475 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 [2024-11-11 16:02:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:04,477 INFO L225 Difference]: With dead ends: 150 [2024-11-11 16:02:04,477 INFO L226 Difference]: Without dead ends: 102 [2024-11-11 16:02:04,477 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 [2024-11-11 16:02:04,478 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 75 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 240 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 [2024-11-11 16:02:04,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 240 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-11 16:02:04,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-11-11 16:02:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.8585858585858586) internal successors, (184), 99 states have internal predecessors, (184), 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) [2024-11-11 16:02:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 184 transitions. [2024-11-11 16:02:04,488 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 184 transitions. Word has length 23 [2024-11-11 16:02:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:04,488 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 184 transitions. [2024-11-11 16:02:04,491 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) [2024-11-11 16:02:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 184 transitions. [2024-11-11 16:02:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-11 16:02:04,493 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:04,493 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] [2024-11-11 16:02:04,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:02:04,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:04,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:04,495 INFO L85 PathProgramCache]: Analyzing trace with hash 120599545, now seen corresponding path program 1 times [2024-11-11 16:02:04,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:04,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679544246] [2024-11-11 16:02:04,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:04,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679544246] [2024-11-11 16:02:04,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679544246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:04,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:04,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:04,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382471560] [2024-11-11 16:02:04,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:04,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:04,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:04,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:04,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:04,582 INFO L87 Difference]: Start difference. First operand 100 states and 184 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) [2024-11-11 16:02:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:04,617 INFO L93 Difference]: Finished difference Result 193 states and 357 transitions. [2024-11-11 16:02:04,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:04,618 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 [2024-11-11 16:02:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:04,620 INFO L225 Difference]: With dead ends: 193 [2024-11-11 16:02:04,620 INFO L226 Difference]: Without dead ends: 191 [2024-11-11 16:02:04,620 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 [2024-11-11 16:02:04,624 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 70 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 185 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 [2024-11-11 16:02:04,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 185 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:04,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-11 16:02:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 133. [2024-11-11 16:02:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 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) [2024-11-11 16:02:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 245 transitions. [2024-11-11 16:02:04,640 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 245 transitions. Word has length 23 [2024-11-11 16:02:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:04,640 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 245 transitions. [2024-11-11 16:02:04,640 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) [2024-11-11 16:02:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 245 transitions. [2024-11-11 16:02:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-11 16:02:04,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:04,641 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] [2024-11-11 16:02:04,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:02:04,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:04,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1873545161, now seen corresponding path program 1 times [2024-11-11 16:02:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:04,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859866753] [2024-11-11 16:02:04,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:04,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:04,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:04,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859866753] [2024-11-11 16:02:04,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859866753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:04,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:04,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:04,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339138724] [2024-11-11 16:02:04,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:04,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:04,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:04,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:04,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:04,695 INFO L87 Difference]: Start difference. First operand 133 states and 245 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) [2024-11-11 16:02:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:04,716 INFO L93 Difference]: Finished difference Result 321 states and 595 transitions. [2024-11-11 16:02:04,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:04,719 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 [2024-11-11 16:02:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:04,721 INFO L225 Difference]: With dead ends: 321 [2024-11-11 16:02:04,721 INFO L226 Difference]: Without dead ends: 193 [2024-11-11 16:02:04,722 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 [2024-11-11 16:02:04,722 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 214 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 [2024-11-11 16:02:04,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 214 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-11 16:02:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2024-11-11 16:02:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.8473684210526315) internal successors, (351), 190 states have internal predecessors, (351), 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) [2024-11-11 16:02:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 351 transitions. [2024-11-11 16:02:04,745 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 351 transitions. Word has length 23 [2024-11-11 16:02:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:04,749 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 351 transitions. [2024-11-11 16:02:04,749 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) [2024-11-11 16:02:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 351 transitions. [2024-11-11 16:02:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 16:02:04,750 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:04,750 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] [2024-11-11 16:02:04,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:02:04,751 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:04,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash -556169332, now seen corresponding path program 1 times [2024-11-11 16:02:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:04,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498383738] [2024-11-11 16:02:04,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:04,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:04,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:04,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498383738] [2024-11-11 16:02:04,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498383738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:04,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:04,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:04,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87917938] [2024-11-11 16:02:04,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:04,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:04,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:04,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:04,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:04,792 INFO L87 Difference]: Start difference. First operand 191 states and 351 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) [2024-11-11 16:02:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:04,806 INFO L93 Difference]: Finished difference Result 288 states and 526 transitions. [2024-11-11 16:02:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:04,807 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 [2024-11-11 16:02:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:04,808 INFO L225 Difference]: With dead ends: 288 [2024-11-11 16:02:04,808 INFO L226 Difference]: Without dead ends: 195 [2024-11-11 16:02:04,808 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 [2024-11-11 16:02:04,809 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 74 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 236 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 [2024-11-11 16:02:04,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 236 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:04,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-11 16:02:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2024-11-11 16:02:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.828125) internal successors, (351), 192 states have internal predecessors, (351), 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) [2024-11-11 16:02:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 351 transitions. [2024-11-11 16:02:04,823 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 351 transitions. Word has length 24 [2024-11-11 16:02:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:04,823 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 351 transitions. [2024-11-11 16:02:04,823 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) [2024-11-11 16:02:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 351 transitions. [2024-11-11 16:02:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 16:02:04,824 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:04,824 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] [2024-11-11 16:02:04,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:02:04,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:04,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:04,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2049854222, now seen corresponding path program 1 times [2024-11-11 16:02:04,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:04,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830022490] [2024-11-11 16:02:04,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:04,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:04,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:04,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830022490] [2024-11-11 16:02:04,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830022490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:04,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:04,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:04,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942502728] [2024-11-11 16:02:04,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:04,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:04,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:04,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:04,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:04,874 INFO L87 Difference]: Start difference. First operand 193 states and 351 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) [2024-11-11 16:02:04,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:04,899 INFO L93 Difference]: Finished difference Result 561 states and 1025 transitions. [2024-11-11 16:02:04,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:04,900 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 [2024-11-11 16:02:04,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:04,902 INFO L225 Difference]: With dead ends: 561 [2024-11-11 16:02:04,902 INFO L226 Difference]: Without dead ends: 375 [2024-11-11 16:02:04,903 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 [2024-11-11 16:02:04,904 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 187 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 [2024-11-11 16:02:04,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:04,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-11 16:02:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2024-11-11 16:02:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.814516129032258) internal successors, (675), 372 states have internal predecessors, (675), 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) [2024-11-11 16:02:04,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 675 transitions. [2024-11-11 16:02:04,918 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 675 transitions. Word has length 24 [2024-11-11 16:02:04,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:04,919 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 675 transitions. [2024-11-11 16:02:04,919 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) [2024-11-11 16:02:04,919 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 675 transitions. [2024-11-11 16:02:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 16:02:04,920 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:04,920 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] [2024-11-11 16:02:04,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:02:04,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:04,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:04,921 INFO L85 PathProgramCache]: Analyzing trace with hash -250968368, now seen corresponding path program 1 times [2024-11-11 16:02:04,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:04,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189566964] [2024-11-11 16:02:04,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:04,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:04,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:04,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189566964] [2024-11-11 16:02:04,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189566964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:04,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:04,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:04,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770168261] [2024-11-11 16:02:04,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:04,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:04,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:04,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:04,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:04,950 INFO L87 Difference]: Start difference. First operand 373 states and 675 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) [2024-11-11 16:02:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:04,971 INFO L93 Difference]: Finished difference Result 481 states and 877 transitions. [2024-11-11 16:02:04,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:04,971 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 [2024-11-11 16:02:04,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:04,974 INFO L225 Difference]: With dead ends: 481 [2024-11-11 16:02:04,974 INFO L226 Difference]: Without dead ends: 479 [2024-11-11 16:02:04,974 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 [2024-11-11 16:02:04,975 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 67 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 260 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 [2024-11-11 16:02:04,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 260 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-11 16:02:04,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 373. [2024-11-11 16:02:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.803763440860215) internal successors, (671), 372 states have internal predecessors, (671), 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) [2024-11-11 16:02:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 671 transitions. [2024-11-11 16:02:04,991 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 671 transitions. Word has length 24 [2024-11-11 16:02:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:04,991 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 671 transitions. [2024-11-11 16:02:04,991 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) [2024-11-11 16:02:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 671 transitions. [2024-11-11 16:02:04,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 16:02:04,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:04,995 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, 1] [2024-11-11 16:02:04,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:02:04,996 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:04,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:04,997 INFO L85 PathProgramCache]: Analyzing trace with hash -878816148, now seen corresponding path program 1 times [2024-11-11 16:02:04,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:04,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537786189] [2024-11-11 16:02:04,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:04,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:05,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:05,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537786189] [2024-11-11 16:02:05,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537786189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:05,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:05,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:05,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328275619] [2024-11-11 16:02:05,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:05,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:05,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:05,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:05,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:05,068 INFO L87 Difference]: Start difference. First operand 373 states and 671 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:05,094 INFO L93 Difference]: Finished difference Result 709 states and 1289 transitions. [2024-11-11 16:02:05,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:05,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-11 16:02:05,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:05,097 INFO L225 Difference]: With dead ends: 709 [2024-11-11 16:02:05,098 INFO L226 Difference]: Without dead ends: 707 [2024-11-11 16:02:05,098 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 [2024-11-11 16:02:05,102 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 64 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 181 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 [2024-11-11 16:02:05,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:05,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-11 16:02:05,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 513. [2024-11-11 16:02:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.779296875) internal successors, (911), 512 states have internal predecessors, (911), 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) [2024-11-11 16:02:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 911 transitions. [2024-11-11 16:02:05,126 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 911 transitions. Word has length 25 [2024-11-11 16:02:05,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:05,128 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 911 transitions. [2024-11-11 16:02:05,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:05,129 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 911 transitions. [2024-11-11 16:02:05,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 16:02:05,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:05,130 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, 1] [2024-11-11 16:02:05,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:02:05,130 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:05,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:05,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1422006442, now seen corresponding path program 1 times [2024-11-11 16:02:05,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:05,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705022271] [2024-11-11 16:02:05,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:05,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:05,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:05,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705022271] [2024-11-11 16:02:05,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705022271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:05,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:05,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:05,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608103415] [2024-11-11 16:02:05,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:05,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:05,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:05,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:05,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:05,179 INFO L87 Difference]: Start difference. First operand 513 states and 911 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:05,205 INFO L93 Difference]: Finished difference Result 1237 states and 2209 transitions. [2024-11-11 16:02:05,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:05,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-11 16:02:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:05,209 INFO L225 Difference]: With dead ends: 1237 [2024-11-11 16:02:05,210 INFO L226 Difference]: Without dead ends: 731 [2024-11-11 16:02:05,211 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 [2024-11-11 16:02:05,212 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 70 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 216 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 [2024-11-11 16:02:05,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:05,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-11 16:02:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2024-11-11 16:02:05,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 1.7733516483516483) internal successors, (1291), 728 states have internal predecessors, (1291), 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) [2024-11-11 16:02:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1291 transitions. [2024-11-11 16:02:05,237 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1291 transitions. Word has length 25 [2024-11-11 16:02:05,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:05,238 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1291 transitions. [2024-11-11 16:02:05,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1291 transitions. [2024-11-11 16:02:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 16:02:05,240 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:05,240 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, 1, 1] [2024-11-11 16:02:05,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:02:05,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:05,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:05,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1473284061, now seen corresponding path program 1 times [2024-11-11 16:02:05,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:05,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249203064] [2024-11-11 16:02:05,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:05,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:05,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:05,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:05,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249203064] [2024-11-11 16:02:05,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249203064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:05,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:05,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:05,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001376412] [2024-11-11 16:02:05,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:05,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:05,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:05,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:05,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:05,278 INFO L87 Difference]: Start difference. First operand 729 states and 1291 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:05,303 INFO L93 Difference]: Finished difference Result 1101 states and 1945 transitions. [2024-11-11 16:02:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-11 16:02:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:05,306 INFO L225 Difference]: With dead ends: 1101 [2024-11-11 16:02:05,307 INFO L226 Difference]: Without dead ends: 743 [2024-11-11 16:02:05,308 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 [2024-11-11 16:02:05,309 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 72 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 228 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 [2024-11-11 16:02:05,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 228 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:05,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-11-11 16:02:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2024-11-11 16:02:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 1.7554054054054054) internal successors, (1299), 740 states have internal predecessors, (1299), 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) [2024-11-11 16:02:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1299 transitions. [2024-11-11 16:02:05,327 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1299 transitions. Word has length 26 [2024-11-11 16:02:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:05,328 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1299 transitions. [2024-11-11 16:02:05,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1299 transitions. [2024-11-11 16:02:05,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 16:02:05,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:05,329 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, 1, 1] [2024-11-11 16:02:05,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:02:05,329 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:05,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:05,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1132739493, now seen corresponding path program 1 times [2024-11-11 16:02:05,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:05,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911131000] [2024-11-11 16:02:05,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:05,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:05,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:05,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911131000] [2024-11-11 16:02:05,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911131000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:05,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:05,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:05,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436095946] [2024-11-11 16:02:05,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:05,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:05,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:05,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:05,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:05,367 INFO L87 Difference]: Start difference. First operand 741 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:05,401 INFO L93 Difference]: Finished difference Result 1385 states and 2461 transitions. [2024-11-11 16:02:05,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:05,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-11 16:02:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:05,407 INFO L225 Difference]: With dead ends: 1385 [2024-11-11 16:02:05,407 INFO L226 Difference]: Without dead ends: 1383 [2024-11-11 16:02:05,408 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 [2024-11-11 16:02:05,408 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 179 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 [2024-11-11 16:02:05,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:05,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-11 16:02:05,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1029. [2024-11-11 16:02:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.722762645914397) internal successors, (1771), 1028 states have internal predecessors, (1771), 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) [2024-11-11 16:02:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1771 transitions. [2024-11-11 16:02:05,435 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1771 transitions. Word has length 26 [2024-11-11 16:02:05,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:05,436 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1771 transitions. [2024-11-11 16:02:05,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1771 transitions. [2024-11-11 16:02:05,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 16:02:05,438 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:05,438 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, 1, 1] [2024-11-11 16:02:05,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:02:05,438 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:05,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash -861405213, now seen corresponding path program 1 times [2024-11-11 16:02:05,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:05,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115845144] [2024-11-11 16:02:05,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:05,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:05,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:05,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115845144] [2024-11-11 16:02:05,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115845144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:05,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:05,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:05,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433128556] [2024-11-11 16:02:05,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:05,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:05,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:05,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:05,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:05,483 INFO L87 Difference]: Start difference. First operand 1029 states and 1771 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:05,521 INFO L93 Difference]: Finished difference Result 2457 states and 4253 transitions. [2024-11-11 16:02:05,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:05,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-11 16:02:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:05,526 INFO L225 Difference]: With dead ends: 2457 [2024-11-11 16:02:05,527 INFO L226 Difference]: Without dead ends: 1447 [2024-11-11 16:02:05,528 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 [2024-11-11 16:02:05,529 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 217 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 [2024-11-11 16:02:05,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 217 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2024-11-11 16:02:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1445. [2024-11-11 16:02:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.7195290858725762) internal successors, (2483), 1444 states have internal predecessors, (2483), 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) [2024-11-11 16:02:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2483 transitions. [2024-11-11 16:02:05,569 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2483 transitions. Word has length 26 [2024-11-11 16:02:05,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:05,570 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2483 transitions. [2024-11-11 16:02:05,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2483 transitions. [2024-11-11 16:02:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 16:02:05,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:05,572 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, 1, 1, 1] [2024-11-11 16:02:05,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 16:02:05,572 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:05,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:05,573 INFO L85 PathProgramCache]: Analyzing trace with hash 755399007, now seen corresponding path program 1 times [2024-11-11 16:02:05,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:05,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833402256] [2024-11-11 16:02:05,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:05,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:05,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:05,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833402256] [2024-11-11 16:02:05,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833402256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:05,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:05,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:05,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381320151] [2024-11-11 16:02:05,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:05,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:05,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:05,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:05,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:05,603 INFO L87 Difference]: Start difference. First operand 1445 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2024-11-11 16:02:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:05,634 INFO L93 Difference]: Finished difference Result 2169 states and 3717 transitions. [2024-11-11 16:02:05,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:05,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2024-11-11 16:02:05,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:05,640 INFO L225 Difference]: With dead ends: 2169 [2024-11-11 16:02:05,641 INFO L226 Difference]: Without dead ends: 1463 [2024-11-11 16:02:05,642 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 [2024-11-11 16:02:05,642 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 71 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 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 [2024-11-11 16:02:05,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2024-11-11 16:02:05,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1461. [2024-11-11 16:02:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1460 states have (on average 1.7006849315068493) internal successors, (2483), 1460 states have internal predecessors, (2483), 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) [2024-11-11 16:02:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2483 transitions. [2024-11-11 16:02:05,684 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2483 transitions. Word has length 27 [2024-11-11 16:02:05,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:05,685 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 2483 transitions. [2024-11-11 16:02:05,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2024-11-11 16:02:05,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2483 transitions. [2024-11-11 16:02:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 16:02:05,686 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:05,686 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, 1, 1, 1] [2024-11-11 16:02:05,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 16:02:05,687 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:05,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:05,687 INFO L85 PathProgramCache]: Analyzing trace with hash -933544735, now seen corresponding path program 1 times [2024-11-11 16:02:05,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:05,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231970193] [2024-11-11 16:02:05,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:05,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:05,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231970193] [2024-11-11 16:02:05,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231970193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:05,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:05,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708123518] [2024-11-11 16:02:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:05,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:05,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:05,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:05,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:05,718 INFO L87 Difference]: Start difference. First operand 1461 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2024-11-11 16:02:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:05,761 INFO L93 Difference]: Finished difference Result 2697 states and 4661 transitions. [2024-11-11 16:02:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:05,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2024-11-11 16:02:05,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:05,779 INFO L225 Difference]: With dead ends: 2697 [2024-11-11 16:02:05,779 INFO L226 Difference]: Without dead ends: 2695 [2024-11-11 16:02:05,780 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 [2024-11-11 16:02:05,780 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 58 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 177 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 [2024-11-11 16:02:05,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 177 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:05,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2024-11-11 16:02:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2053. [2024-11-11 16:02:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.662280701754386) internal successors, (3411), 2052 states have internal predecessors, (3411), 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) [2024-11-11 16:02:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3411 transitions. [2024-11-11 16:02:05,836 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3411 transitions. Word has length 27 [2024-11-11 16:02:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:05,837 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 3411 transitions. [2024-11-11 16:02:05,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2024-11-11 16:02:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3411 transitions. [2024-11-11 16:02:05,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 16:02:05,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:05,839 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, 1, 1, 1] [2024-11-11 16:02:05,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 16:02:05,840 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:05,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:05,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1367277855, now seen corresponding path program 1 times [2024-11-11 16:02:05,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:05,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118042163] [2024-11-11 16:02:05,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:05,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:05,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:05,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118042163] [2024-11-11 16:02:05,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118042163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:05,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:05,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:05,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331919114] [2024-11-11 16:02:05,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:05,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:05,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:05,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:05,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:05,885 INFO L87 Difference]: Start difference. First operand 2053 states and 3411 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2024-11-11 16:02:05,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:05,935 INFO L93 Difference]: Finished difference Result 4873 states and 8149 transitions. [2024-11-11 16:02:05,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:05,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2024-11-11 16:02:05,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:05,944 INFO L225 Difference]: With dead ends: 4873 [2024-11-11 16:02:05,944 INFO L226 Difference]: Without dead ends: 2855 [2024-11-11 16:02:05,947 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 [2024-11-11 16:02:05,948 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 218 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 [2024-11-11 16:02:05,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2024-11-11 16:02:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2853. [2024-11-11 16:02:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2852 states have (on average 1.66164095371669) internal successors, (4739), 2852 states have internal predecessors, (4739), 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) [2024-11-11 16:02:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4739 transitions. [2024-11-11 16:02:06,022 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4739 transitions. Word has length 27 [2024-11-11 16:02:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:06,022 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 4739 transitions. [2024-11-11 16:02:06,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2024-11-11 16:02:06,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4739 transitions. [2024-11-11 16:02:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 16:02:06,025 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:06,025 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, 1, 1, 1, 1] [2024-11-11 16:02:06,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 16:02:06,026 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:06,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:06,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1125097720, now seen corresponding path program 1 times [2024-11-11 16:02:06,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:06,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199835972] [2024-11-11 16:02:06,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:06,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:06,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:06,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199835972] [2024-11-11 16:02:06,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199835972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:06,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:06,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:06,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718653746] [2024-11-11 16:02:06,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:06,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:06,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:06,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:06,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:06,062 INFO L87 Difference]: Start difference. First operand 2853 states and 4739 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-11 16:02:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:06,115 INFO L93 Difference]: Finished difference Result 4281 states and 7093 transitions. [2024-11-11 16:02:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:06,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2024-11-11 16:02:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:06,125 INFO L225 Difference]: With dead ends: 4281 [2024-11-11 16:02:06,126 INFO L226 Difference]: Without dead ends: 2887 [2024-11-11 16:02:06,128 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 [2024-11-11 16:02:06,129 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 70 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 220 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 [2024-11-11 16:02:06,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 220 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2024-11-11 16:02:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2885. [2024-11-11 16:02:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2884 states have (on average 1.6432038834951457) internal successors, (4739), 2884 states have internal predecessors, (4739), 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) [2024-11-11 16:02:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4739 transitions. [2024-11-11 16:02:06,234 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4739 transitions. Word has length 28 [2024-11-11 16:02:06,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:06,235 INFO L471 AbstractCegarLoop]: Abstraction has 2885 states and 4739 transitions. [2024-11-11 16:02:06,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-11 16:02:06,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4739 transitions. [2024-11-11 16:02:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 16:02:06,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:06,237 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, 1, 1, 1, 1] [2024-11-11 16:02:06,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 16:02:06,237 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:06,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:06,238 INFO L85 PathProgramCache]: Analyzing trace with hash -563846022, now seen corresponding path program 1 times [2024-11-11 16:02:06,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:06,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585632355] [2024-11-11 16:02:06,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:06,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:06,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:06,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585632355] [2024-11-11 16:02:06,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585632355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:06,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:06,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:06,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889810986] [2024-11-11 16:02:06,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:06,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:06,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:06,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:06,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:06,263 INFO L87 Difference]: Start difference. First operand 2885 states and 4739 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-11 16:02:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:06,338 INFO L93 Difference]: Finished difference Result 5257 states and 8805 transitions. [2024-11-11 16:02:06,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:06,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2024-11-11 16:02:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:06,356 INFO L225 Difference]: With dead ends: 5257 [2024-11-11 16:02:06,356 INFO L226 Difference]: Without dead ends: 5255 [2024-11-11 16:02:06,359 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 [2024-11-11 16:02:06,359 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 55 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 175 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 [2024-11-11 16:02:06,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2024-11-11 16:02:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 4101. [2024-11-11 16:02:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.6007317073170733) internal successors, (6563), 4100 states have internal predecessors, (6563), 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) [2024-11-11 16:02:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6563 transitions. [2024-11-11 16:02:06,466 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6563 transitions. Word has length 28 [2024-11-11 16:02:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:06,466 INFO L471 AbstractCegarLoop]: Abstraction has 4101 states and 6563 transitions. [2024-11-11 16:02:06,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-11 16:02:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6563 transitions. [2024-11-11 16:02:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 16:02:06,470 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:06,470 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, 1, 1, 1, 1] [2024-11-11 16:02:06,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 16:02:06,470 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:06,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:06,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1736976568, now seen corresponding path program 1 times [2024-11-11 16:02:06,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:06,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687568263] [2024-11-11 16:02:06,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:06,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:06,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:06,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687568263] [2024-11-11 16:02:06,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687568263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:06,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:06,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:06,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647037540] [2024-11-11 16:02:06,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:06,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:06,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:06,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:06,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:06,517 INFO L87 Difference]: Start difference. First operand 4101 states and 6563 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-11 16:02:06,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:06,627 INFO L93 Difference]: Finished difference Result 9673 states and 15589 transitions. [2024-11-11 16:02:06,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:06,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2024-11-11 16:02:06,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:06,646 INFO L225 Difference]: With dead ends: 9673 [2024-11-11 16:02:06,646 INFO L226 Difference]: Without dead ends: 5639 [2024-11-11 16:02:06,651 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 [2024-11-11 16:02:06,651 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 219 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 [2024-11-11 16:02:06,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:06,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2024-11-11 16:02:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5637. [2024-11-11 16:02:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.60166784953868) internal successors, (9027), 5636 states have internal predecessors, (9027), 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) [2024-11-11 16:02:06,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 9027 transitions. [2024-11-11 16:02:06,798 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 9027 transitions. Word has length 28 [2024-11-11 16:02:06,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:06,799 INFO L471 AbstractCegarLoop]: Abstraction has 5637 states and 9027 transitions. [2024-11-11 16:02:06,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-11 16:02:06,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 9027 transitions. [2024-11-11 16:02:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 16:02:06,803 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:06,803 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, 1, 1, 1, 1, 1] [2024-11-11 16:02:06,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 16:02:06,804 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:06,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash -299143724, now seen corresponding path program 1 times [2024-11-11 16:02:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631719018] [2024-11-11 16:02:06,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:06,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:06,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:06,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631719018] [2024-11-11 16:02:06,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631719018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:06,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:06,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:06,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987018339] [2024-11-11 16:02:06,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:06,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:06,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:06,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:06,853 INFO L87 Difference]: Start difference. First operand 5637 states and 9027 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2024-11-11 16:02:06,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:06,936 INFO L93 Difference]: Finished difference Result 8457 states and 13509 transitions. [2024-11-11 16:02:06,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:06,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-11-11 16:02:06,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:06,950 INFO L225 Difference]: With dead ends: 8457 [2024-11-11 16:02:06,950 INFO L226 Difference]: Without dead ends: 5703 [2024-11-11 16:02:06,958 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 [2024-11-11 16:02:06,958 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 69 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 216 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 [2024-11-11 16:02:06,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 216 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2024-11-11 16:02:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5701. [2024-11-11 16:02:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5701 states, 5700 states have (on average 1.5836842105263158) internal successors, (9027), 5700 states have internal predecessors, (9027), 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) [2024-11-11 16:02:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 9027 transitions. [2024-11-11 16:02:07,102 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 9027 transitions. Word has length 29 [2024-11-11 16:02:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:07,103 INFO L471 AbstractCegarLoop]: Abstraction has 5701 states and 9027 transitions. [2024-11-11 16:02:07,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2024-11-11 16:02:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 9027 transitions. [2024-11-11 16:02:07,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 16:02:07,108 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:07,108 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, 1, 1, 1, 1, 1] [2024-11-11 16:02:07,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 16:02:07,108 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:07,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:07,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1988087466, now seen corresponding path program 1 times [2024-11-11 16:02:07,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:07,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949384400] [2024-11-11 16:02:07,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:07,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:07,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949384400] [2024-11-11 16:02:07,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949384400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:07,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:07,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:07,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356113647] [2024-11-11 16:02:07,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:07,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:07,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:07,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:07,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:07,149 INFO L87 Difference]: Start difference. First operand 5701 states and 9027 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2024-11-11 16:02:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:07,300 INFO L93 Difference]: Finished difference Result 10249 states and 16581 transitions. [2024-11-11 16:02:07,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:07,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-11-11 16:02:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:07,323 INFO L225 Difference]: With dead ends: 10249 [2024-11-11 16:02:07,323 INFO L226 Difference]: Without dead ends: 10247 [2024-11-11 16:02:07,327 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 [2024-11-11 16:02:07,328 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 52 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 173 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 [2024-11-11 16:02:07,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2024-11-11 16:02:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 8197. [2024-11-11 16:02:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.5386774036115178) internal successors, (12611), 8196 states have internal predecessors, (12611), 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) [2024-11-11 16:02:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 12611 transitions. [2024-11-11 16:02:07,542 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 12611 transitions. Word has length 29 [2024-11-11 16:02:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:07,542 INFO L471 AbstractCegarLoop]: Abstraction has 8197 states and 12611 transitions. [2024-11-11 16:02:07,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2024-11-11 16:02:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 12611 transitions. [2024-11-11 16:02:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 16:02:07,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:07,551 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, 1, 1, 1, 1, 1] [2024-11-11 16:02:07,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 16:02:07,551 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:07,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:07,551 INFO L85 PathProgramCache]: Analyzing trace with hash 312735124, now seen corresponding path program 1 times [2024-11-11 16:02:07,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:07,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644013175] [2024-11-11 16:02:07,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:07,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:07,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:07,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644013175] [2024-11-11 16:02:07,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644013175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:07,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:07,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:07,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399827180] [2024-11-11 16:02:07,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:07,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:07,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:07,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:07,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:07,581 INFO L87 Difference]: Start difference. First operand 8197 states and 12611 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2024-11-11 16:02:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:07,790 INFO L93 Difference]: Finished difference Result 19209 states and 29765 transitions. [2024-11-11 16:02:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:07,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-11-11 16:02:07,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:07,811 INFO L225 Difference]: With dead ends: 19209 [2024-11-11 16:02:07,812 INFO L226 Difference]: Without dead ends: 11143 [2024-11-11 16:02:07,821 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 [2024-11-11 16:02:07,823 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 66 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 220 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 [2024-11-11 16:02:07,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11143 states. [2024-11-11 16:02:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11143 to 11141. [2024-11-11 16:02:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11141 states, 11140 states have (on average 1.5399461400359067) internal successors, (17155), 11140 states have internal predecessors, (17155), 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) [2024-11-11 16:02:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11141 states to 11141 states and 17155 transitions. [2024-11-11 16:02:08,142 INFO L78 Accepts]: Start accepts. Automaton has 11141 states and 17155 transitions. Word has length 29 [2024-11-11 16:02:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:08,142 INFO L471 AbstractCegarLoop]: Abstraction has 11141 states and 17155 transitions. [2024-11-11 16:02:08,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2024-11-11 16:02:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 11141 states and 17155 transitions. [2024-11-11 16:02:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 16:02:08,151 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:08,151 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, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:08,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 16:02:08,151 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:08,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:08,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1500955187, now seen corresponding path program 1 times [2024-11-11 16:02:08,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:08,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341311251] [2024-11-11 16:02:08,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:08,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:08,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341311251] [2024-11-11 16:02:08,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341311251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:08,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:08,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:08,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312406015] [2024-11-11 16:02:08,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:08,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:08,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:08,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:08,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:08,179 INFO L87 Difference]: Start difference. First operand 11141 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2024-11-11 16:02:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:08,370 INFO L93 Difference]: Finished difference Result 16713 states and 25669 transitions. [2024-11-11 16:02:08,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:08,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2024-11-11 16:02:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:08,393 INFO L225 Difference]: With dead ends: 16713 [2024-11-11 16:02:08,393 INFO L226 Difference]: Without dead ends: 11271 [2024-11-11 16:02:08,401 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 [2024-11-11 16:02:08,402 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 68 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 212 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 [2024-11-11 16:02:08,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11271 states. [2024-11-11 16:02:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11271 to 11269. [2024-11-11 16:02:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.522452964146255) internal successors, (17155), 11268 states have internal predecessors, (17155), 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) [2024-11-11 16:02:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 17155 transitions. [2024-11-11 16:02:08,722 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 17155 transitions. Word has length 30 [2024-11-11 16:02:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:08,723 INFO L471 AbstractCegarLoop]: Abstraction has 11269 states and 17155 transitions. [2024-11-11 16:02:08,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2024-11-11 16:02:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 17155 transitions. [2024-11-11 16:02:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 16:02:08,731 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:08,731 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, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:08,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 16:02:08,732 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:08,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:08,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1105068367, now seen corresponding path program 1 times [2024-11-11 16:02:08,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:08,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320100110] [2024-11-11 16:02:08,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:08,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320100110] [2024-11-11 16:02:08,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320100110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:08,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:08,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:08,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907069711] [2024-11-11 16:02:08,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:08,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:08,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:08,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:08,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:08,758 INFO L87 Difference]: Start difference. First operand 11269 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2024-11-11 16:02:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:09,058 INFO L93 Difference]: Finished difference Result 19977 states and 31109 transitions. [2024-11-11 16:02:09,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:09,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2024-11-11 16:02:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:09,091 INFO L225 Difference]: With dead ends: 19977 [2024-11-11 16:02:09,091 INFO L226 Difference]: Without dead ends: 19975 [2024-11-11 16:02:09,095 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 [2024-11-11 16:02:09,096 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 49 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 171 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 [2024-11-11 16:02:09,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19975 states. [2024-11-11 16:02:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19975 to 16389. [2024-11-11 16:02:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16389 states, 16388 states have (on average 1.476385159873078) internal successors, (24195), 16388 states have internal predecessors, (24195), 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) [2024-11-11 16:02:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16389 states to 16389 states and 24195 transitions. [2024-11-11 16:02:09,518 INFO L78 Accepts]: Start accepts. Automaton has 16389 states and 24195 transitions. Word has length 30 [2024-11-11 16:02:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:09,518 INFO L471 AbstractCegarLoop]: Abstraction has 16389 states and 24195 transitions. [2024-11-11 16:02:09,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2024-11-11 16:02:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 16389 states and 24195 transitions. [2024-11-11 16:02:09,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 16:02:09,538 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:09,538 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, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:09,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 16:02:09,539 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:09,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash -889076339, now seen corresponding path program 1 times [2024-11-11 16:02:09,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:09,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996892866] [2024-11-11 16:02:09,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:09,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:09,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:09,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996892866] [2024-11-11 16:02:09,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996892866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:09,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:09,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:09,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526920484] [2024-11-11 16:02:09,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:09,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:09,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:09,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:09,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:09,583 INFO L87 Difference]: Start difference. First operand 16389 states and 24195 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2024-11-11 16:02:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:09,948 INFO L93 Difference]: Finished difference Result 38153 states and 56709 transitions. [2024-11-11 16:02:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:09,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2024-11-11 16:02:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:09,988 INFO L225 Difference]: With dead ends: 38153 [2024-11-11 16:02:09,988 INFO L226 Difference]: Without dead ends: 22023 [2024-11-11 16:02:10,014 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 [2024-11-11 16:02:10,014 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 65 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 221 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 [2024-11-11 16:02:10,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 221 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:10,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22023 states. [2024-11-11 16:02:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22023 to 22021. [2024-11-11 16:02:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22021 states, 22020 states have (on average 1.4766121707538602) internal successors, (32515), 22020 states have internal predecessors, (32515), 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) [2024-11-11 16:02:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 32515 transitions. [2024-11-11 16:02:10,584 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 32515 transitions. Word has length 30 [2024-11-11 16:02:10,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:10,585 INFO L471 AbstractCegarLoop]: Abstraction has 22021 states and 32515 transitions. [2024-11-11 16:02:10,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2024-11-11 16:02:10,585 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 32515 transitions. [2024-11-11 16:02:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 16:02:10,602 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:10,602 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:10,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 16:02:10,602 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:10,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:10,603 INFO L85 PathProgramCache]: Analyzing trace with hash -102404535, now seen corresponding path program 1 times [2024-11-11 16:02:10,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:10,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812990233] [2024-11-11 16:02:10,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:10,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:10,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:10,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812990233] [2024-11-11 16:02:10,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812990233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:10,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:10,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:10,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604245224] [2024-11-11 16:02:10,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:10,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:10,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:10,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:10,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:10,633 INFO L87 Difference]: Start difference. First operand 22021 states and 32515 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:10,955 INFO L93 Difference]: Finished difference Result 33033 states and 48645 transitions. [2024-11-11 16:02:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:10,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-11 16:02:10,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:10,990 INFO L225 Difference]: With dead ends: 33033 [2024-11-11 16:02:10,990 INFO L226 Difference]: Without dead ends: 22279 [2024-11-11 16:02:11,001 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 [2024-11-11 16:02:11,002 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 67 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 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 [2024-11-11 16:02:11,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22279 states. [2024-11-11 16:02:11,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22279 to 22277. [2024-11-11 16:02:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22277 states, 22276 states have (on average 1.4596426647513019) internal successors, (32515), 22276 states have internal predecessors, (32515), 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) [2024-11-11 16:02:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22277 states to 22277 states and 32515 transitions. [2024-11-11 16:02:11,398 INFO L78 Accepts]: Start accepts. Automaton has 22277 states and 32515 transitions. Word has length 31 [2024-11-11 16:02:11,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:11,398 INFO L471 AbstractCegarLoop]: Abstraction has 22277 states and 32515 transitions. [2024-11-11 16:02:11,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 22277 states and 32515 transitions. [2024-11-11 16:02:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 16:02:11,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:11,417 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:11,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 16:02:11,417 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:11,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:11,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1791348277, now seen corresponding path program 1 times [2024-11-11 16:02:11,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:11,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688967604] [2024-11-11 16:02:11,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:11,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:11,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:11,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688967604] [2024-11-11 16:02:11,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688967604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:11,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:11,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:11,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169571335] [2024-11-11 16:02:11,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:11,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:11,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:11,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:11,443 INFO L87 Difference]: Start difference. First operand 22277 states and 32515 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:11,908 INFO L93 Difference]: Finished difference Result 38921 states and 58117 transitions. [2024-11-11 16:02:11,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:11,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-11 16:02:11,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:11,976 INFO L225 Difference]: With dead ends: 38921 [2024-11-11 16:02:11,976 INFO L226 Difference]: Without dead ends: 38919 [2024-11-11 16:02:11,985 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 [2024-11-11 16:02:11,986 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 46 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 169 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 [2024-11-11 16:02:11,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:12,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38919 states. [2024-11-11 16:02:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38919 to 32773. [2024-11-11 16:02:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32773 states, 32772 states have (on average 1.4139814475772001) internal successors, (46339), 32772 states have internal predecessors, (46339), 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) [2024-11-11 16:02:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32773 states to 32773 states and 46339 transitions. [2024-11-11 16:02:12,868 INFO L78 Accepts]: Start accepts. Automaton has 32773 states and 46339 transitions. Word has length 31 [2024-11-11 16:02:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:12,868 INFO L471 AbstractCegarLoop]: Abstraction has 32773 states and 46339 transitions. [2024-11-11 16:02:12,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 32773 states and 46339 transitions. [2024-11-11 16:02:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 16:02:12,898 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:12,898 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:12,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 16:02:12,898 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:12,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash 509474313, now seen corresponding path program 1 times [2024-11-11 16:02:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:12,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699967217] [2024-11-11 16:02:12,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:12,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:12,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:12,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699967217] [2024-11-11 16:02:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699967217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:12,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:12,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592902018] [2024-11-11 16:02:12,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:12,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:12,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:12,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:12,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:12,932 INFO L87 Difference]: Start difference. First operand 32773 states and 46339 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:13,780 INFO L93 Difference]: Finished difference Result 75785 states and 107781 transitions. [2024-11-11 16:02:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:13,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-11 16:02:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:13,831 INFO L225 Difference]: With dead ends: 75785 [2024-11-11 16:02:13,831 INFO L226 Difference]: Without dead ends: 43527 [2024-11-11 16:02:13,858 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 [2024-11-11 16:02:13,859 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 64 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 222 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 [2024-11-11 16:02:13,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:13,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43527 states. [2024-11-11 16:02:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43527 to 43525. [2024-11-11 16:02:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43525 states, 43524 states have (on average 1.4117038875103392) internal successors, (61443), 43524 states have internal predecessors, (61443), 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) [2024-11-11 16:02:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43525 states to 43525 states and 61443 transitions. [2024-11-11 16:02:14,804 INFO L78 Accepts]: Start accepts. Automaton has 43525 states and 61443 transitions. Word has length 31 [2024-11-11 16:02:14,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:14,804 INFO L471 AbstractCegarLoop]: Abstraction has 43525 states and 61443 transitions. [2024-11-11 16:02:14,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 43525 states and 61443 transitions. [2024-11-11 16:02:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 16:02:14,828 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:14,828 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:14,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 16:02:14,828 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:14,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash 302993058, now seen corresponding path program 1 times [2024-11-11 16:02:14,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:14,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544566699] [2024-11-11 16:02:14,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:14,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:14,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:14,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544566699] [2024-11-11 16:02:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544566699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:14,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387719110] [2024-11-11 16:02:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:14,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:14,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:14,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:14,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:14,850 INFO L87 Difference]: Start difference. First operand 43525 states and 61443 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:15,369 INFO L93 Difference]: Finished difference Result 65289 states and 91909 transitions. [2024-11-11 16:02:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:15,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-11 16:02:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:15,413 INFO L225 Difference]: With dead ends: 65289 [2024-11-11 16:02:15,414 INFO L226 Difference]: Without dead ends: 44039 [2024-11-11 16:02:15,432 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 [2024-11-11 16:02:15,433 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 66 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 204 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 [2024-11-11 16:02:15,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44039 states. [2024-11-11 16:02:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44039 to 44037. [2024-11-11 16:02:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44037 states, 44036 states have (on average 1.395290217095104) internal successors, (61443), 44036 states have internal predecessors, (61443), 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) [2024-11-11 16:02:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44037 states to 44037 states and 61443 transitions. [2024-11-11 16:02:16,501 INFO L78 Accepts]: Start accepts. Automaton has 44037 states and 61443 transitions. Word has length 32 [2024-11-11 16:02:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:16,501 INFO L471 AbstractCegarLoop]: Abstraction has 44037 states and 61443 transitions. [2024-11-11 16:02:16,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 44037 states and 61443 transitions. [2024-11-11 16:02:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 16:02:16,524 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:16,524 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:16,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-11 16:02:16,524 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:16,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:16,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1385950684, now seen corresponding path program 1 times [2024-11-11 16:02:16,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:16,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388547926] [2024-11-11 16:02:16,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:16,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:16,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:16,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388547926] [2024-11-11 16:02:16,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388547926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:16,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:16,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789463113] [2024-11-11 16:02:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:16,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:16,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:16,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:16,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:16,545 INFO L87 Difference]: Start difference. First operand 44037 states and 61443 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:17,395 INFO L93 Difference]: Finished difference Result 129033 states and 178181 transitions. [2024-11-11 16:02:17,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:17,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-11 16:02:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:17,569 INFO L225 Difference]: With dead ends: 129033 [2024-11-11 16:02:17,569 INFO L226 Difference]: Without dead ends: 86023 [2024-11-11 16:02:17,598 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 [2024-11-11 16:02:17,599 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 64 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 187 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 [2024-11-11 16:02:17,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86023 states. [2024-11-11 16:02:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86023 to 86021. [2024-11-11 16:02:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86021 states, 86020 states have (on average 1.357114624505929) internal successors, (116739), 86020 states have internal predecessors, (116739), 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) [2024-11-11 16:02:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86021 states to 86021 states and 116739 transitions. [2024-11-11 16:02:19,206 INFO L78 Accepts]: Start accepts. Automaton has 86021 states and 116739 transitions. Word has length 32 [2024-11-11 16:02:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:19,206 INFO L471 AbstractCegarLoop]: Abstraction has 86021 states and 116739 transitions. [2024-11-11 16:02:19,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 86021 states and 116739 transitions. [2024-11-11 16:02:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 16:02:19,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:19,260 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:19,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-11 16:02:19,260 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:19,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:19,261 INFO L85 PathProgramCache]: Analyzing trace with hash 608194022, now seen corresponding path program 1 times [2024-11-11 16:02:19,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:19,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281179592] [2024-11-11 16:02:19,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:19,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:19,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:19,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281179592] [2024-11-11 16:02:19,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281179592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:19,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:19,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:19,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503587028] [2024-11-11 16:02:19,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:19,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:19,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:19,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:19,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:19,281 INFO L87 Difference]: Start difference. First operand 86021 states and 116739 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:20,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:20,623 INFO L93 Difference]: Finished difference Result 96265 states and 135173 transitions. [2024-11-11 16:02:20,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:20,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-11 16:02:20,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:20,723 INFO L225 Difference]: With dead ends: 96265 [2024-11-11 16:02:20,723 INFO L226 Difference]: Without dead ends: 96263 [2024-11-11 16:02:20,737 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 [2024-11-11 16:02:20,739 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 43 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 220 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 [2024-11-11 16:02:20,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 220 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:20,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96263 states. [2024-11-11 16:02:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96263 to 86021. [2024-11-11 16:02:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86021 states, 86020 states have (on average 1.345210416182283) internal successors, (115715), 86020 states have internal predecessors, (115715), 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) [2024-11-11 16:02:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86021 states to 86021 states and 115715 transitions. [2024-11-11 16:02:22,262 INFO L78 Accepts]: Start accepts. Automaton has 86021 states and 115715 transitions. Word has length 32 [2024-11-11 16:02:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:22,262 INFO L471 AbstractCegarLoop]: Abstraction has 86021 states and 115715 transitions. [2024-11-11 16:02:22,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 86021 states and 115715 transitions. [2024-11-11 16:02:22,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 16:02:22,308 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:22,308 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:22,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-11 16:02:22,309 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:22,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:22,309 INFO L85 PathProgramCache]: Analyzing trace with hash -14583106, now seen corresponding path program 1 times [2024-11-11 16:02:22,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:22,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334833478] [2024-11-11 16:02:22,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:22,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:22,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:22,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334833478] [2024-11-11 16:02:22,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334833478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:22,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:22,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:22,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175459771] [2024-11-11 16:02:22,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:22,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:22,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:22,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:22,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:22,337 INFO L87 Difference]: Start difference. First operand 86021 states and 115715 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:24,153 INFO L93 Difference]: Finished difference Result 146441 states and 200709 transitions. [2024-11-11 16:02:24,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:24,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-11 16:02:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:24,302 INFO L225 Difference]: With dead ends: 146441 [2024-11-11 16:02:24,302 INFO L226 Difference]: Without dead ends: 146439 [2024-11-11 16:02:24,326 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 [2024-11-11 16:02:24,326 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 40 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 165 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 [2024-11-11 16:02:24,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:24,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146439 states. [2024-11-11 16:02:26,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146439 to 130053. [2024-11-11 16:02:26,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130053 states, 130052 states have (on average 1.3070694799003475) internal successors, (169987), 130052 states have internal predecessors, (169987), 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) [2024-11-11 16:02:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130053 states to 130053 states and 169987 transitions. [2024-11-11 16:02:26,889 INFO L78 Accepts]: Start accepts. Automaton has 130053 states and 169987 transitions. Word has length 33 [2024-11-11 16:02:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:26,890 INFO L471 AbstractCegarLoop]: Abstraction has 130053 states and 169987 transitions. [2024-11-11 16:02:26,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 130053 states and 169987 transitions. [2024-11-11 16:02:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 16:02:26,938 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:26,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:26,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-11 16:02:26,938 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:26,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:26,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2008727812, now seen corresponding path program 1 times [2024-11-11 16:02:26,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:26,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142491404] [2024-11-11 16:02:26,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:26,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:26,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:26,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142491404] [2024-11-11 16:02:26,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142491404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:26,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:26,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:26,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180610251] [2024-11-11 16:02:26,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:26,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:26,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:26,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:26,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:26,959 INFO L87 Difference]: Start difference. First operand 130053 states and 169987 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:29,325 INFO L93 Difference]: Finished difference Result 297993 states and 391173 transitions. [2024-11-11 16:02:29,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:29,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-11 16:02:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:29,517 INFO L225 Difference]: With dead ends: 297993 [2024-11-11 16:02:29,517 INFO L226 Difference]: Without dead ends: 168967 [2024-11-11 16:02:29,579 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 [2024-11-11 16:02:29,580 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 62 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 224 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 [2024-11-11 16:02:29,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168967 states. [2024-11-11 16:02:32,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168967 to 168965. [2024-11-11 16:02:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168965 states, 168964 states have (on average 1.2969567481830448) internal successors, (219139), 168964 states have internal predecessors, (219139), 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) [2024-11-11 16:02:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168965 states to 168965 states and 219139 transitions. [2024-11-11 16:02:33,155 INFO L78 Accepts]: Start accepts. Automaton has 168965 states and 219139 transitions. Word has length 33 [2024-11-11 16:02:33,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:33,156 INFO L471 AbstractCegarLoop]: Abstraction has 168965 states and 219139 transitions. [2024-11-11 16:02:33,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:02:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 168965 states and 219139 transitions. [2024-11-11 16:02:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 16:02:33,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:33,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:33,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-11 16:02:33,244 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:33,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:33,245 INFO L85 PathProgramCache]: Analyzing trace with hash -451860807, now seen corresponding path program 1 times [2024-11-11 16:02:33,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:33,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575482413] [2024-11-11 16:02:33,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:33,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:33,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:33,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575482413] [2024-11-11 16:02:33,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575482413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:33,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:33,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788112402] [2024-11-11 16:02:33,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:33,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:33,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:33,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:33,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:33,265 INFO L87 Difference]: Start difference. First operand 168965 states and 219139 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-11-11 16:02:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:35,061 INFO L93 Difference]: Finished difference Result 254985 states and 330757 transitions. [2024-11-11 16:02:35,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:35,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2024-11-11 16:02:35,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:35,283 INFO L225 Difference]: With dead ends: 254985 [2024-11-11 16:02:35,283 INFO L226 Difference]: Without dead ends: 172039 [2024-11-11 16:02:35,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 [2024-11-11 16:02:35,343 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 196 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 [2024-11-11 16:02:35,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172039 states. [2024-11-11 16:02:38,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172039 to 172037. [2024-11-11 16:02:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172037 states, 172036 states have (on average 1.2857018298495664) internal successors, (221187), 172036 states have internal predecessors, (221187), 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) [2024-11-11 16:02:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172037 states to 172037 states and 221187 transitions. [2024-11-11 16:02:38,681 INFO L78 Accepts]: Start accepts. Automaton has 172037 states and 221187 transitions. Word has length 34 [2024-11-11 16:02:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:38,682 INFO L471 AbstractCegarLoop]: Abstraction has 172037 states and 221187 transitions. [2024-11-11 16:02:38,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-11-11 16:02:38,682 INFO L276 IsEmpty]: Start isEmpty. Operand 172037 states and 221187 transitions. [2024-11-11 16:02:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 16:02:38,743 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:38,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:38,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-11 16:02:38,744 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:38,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:38,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2140804549, now seen corresponding path program 1 times [2024-11-11 16:02:38,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:02:38,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915924836] [2024-11-11 16:02:38,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:38,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:02:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:02:38,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:02:38,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915924836] [2024-11-11 16:02:38,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915924836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:38,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:38,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:02:38,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060495972] [2024-11-11 16:02:38,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:38,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:02:38,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:02:38,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:02:38,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:02:38,764 INFO L87 Difference]: Start difference. First operand 172037 states and 221187 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-11-11 16:02:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:41,972 INFO L93 Difference]: Finished difference Result 286729 states and 372741 transitions. [2024-11-11 16:02:41,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:02:41,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2024-11-11 16:02:41,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:42,302 INFO L225 Difference]: With dead ends: 286729 [2024-11-11 16:02:42,302 INFO L226 Difference]: Without dead ends: 286727 [2024-11-11 16:02:42,352 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 [2024-11-11 16:02:42,352 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 37 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 163 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 [2024-11-11 16:02:42,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286727 states.