./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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_14-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 21:15:37,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 21:15:37,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 21:15:37,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 21:15:37,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 21:15:37,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 21:15:37,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 21:15:37,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 21:15:37,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 21:15:37,560 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 21:15:37,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 21:15:37,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 21:15:37,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 21:15:37,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 21:15:37,563 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 21:15:37,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 21:15:37,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 21:15:37,565 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 21:15:37,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 21:15:37,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 21:15:37,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 21:15:37,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 21:15:37,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 21:15:37,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 21:15:37,567 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 21:15:37,567 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 21:15:37,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 21:15:37,569 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 21:15:37,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 21:15:37,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 21:15:37,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 21:15:37,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 21:15:37,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:15:37,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 21:15:37,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 21:15:37,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 21:15:37,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 21:15:37,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 21:15:37,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 21:15:37,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 21:15:37,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 21:15:37,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 21:15:37,574 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 -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2024-11-21 21:15:37,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:15:37,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:15:37,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:15:37,795 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:15:37,795 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:15:37,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-1.c [2024-11-21 21:15:39,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:15:39,216 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:15:39,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2024-11-21 21:15:39,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ebbe0373/6c99c60f5f7941518eab7813789f02df/FLAG4ec210858 [2024-11-21 21:15:39,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ebbe0373/6c99c60f5f7941518eab7813789f02df [2024-11-21 21:15:39,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:15:39,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:15:39,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:15:39,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:15:39,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:15:39,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:15:39" (1/1) ... [2024-11-21 21:15:39,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b28dce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39, skipping insertion in model container [2024-11-21 21:15:39,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:15:39" (1/1) ... [2024-11-21 21:15:39,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:15:39,827 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_14-1.c[5283,5296] [2024-11-21 21:15:39,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:15:39,840 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:15:39,868 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_14-1.c[5283,5296] [2024-11-21 21:15:39,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:15:39,890 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:15:39,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39 WrapperNode [2024-11-21 21:15:39,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:15:39,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:15:39,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:15:39,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:15:39,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39" (1/1) ... [2024-11-21 21:15:39,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39" (1/1) ... [2024-11-21 21:15:39,923 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 196 [2024-11-21 21:15:39,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:15:39,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:15:39,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:15:39,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:15:39,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39" (1/1) ... [2024-11-21 21:15:39,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39" (1/1) ... [2024-11-21 21:15:39,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39" (1/1) ... [2024-11-21 21:15:39,944 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-21 21:15:39,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39" (1/1) ... [2024-11-21 21:15:39,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39" (1/1) ... [2024-11-21 21:15:39,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39" (1/1) ... [2024-11-21 21:15:39,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39" (1/1) ... [2024-11-21 21:15:39,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39" (1/1) ... [2024-11-21 21:15:39,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39" (1/1) ... [2024-11-21 21:15:39,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:15:39,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:15:39,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:15:39,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:15:39,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39" (1/1) ... [2024-11-21 21:15:39,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:15:39,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:15:39,978 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-21 21:15:39,980 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-21 21:15:40,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:15:40,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:15:40,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:15:40,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 21:15:40,066 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:15:40,067 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:15:40,266 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-21 21:15:40,267 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:15:40,281 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:15:40,281 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 21:15:40,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:15:40 BoogieIcfgContainer [2024-11-21 21:15:40,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:15:40,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:15:40,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:15:40,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:15:40,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:15:39" (1/3) ... [2024-11-21 21:15:40,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37619f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:15:40, skipping insertion in model container [2024-11-21 21:15:40,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:39" (2/3) ... [2024-11-21 21:15:40,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37619f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:15:40, skipping insertion in model container [2024-11-21 21:15:40,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:15:40" (3/3) ... [2024-11-21 21:15:40,290 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2024-11-21 21:15:40,303 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:15:40,303 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:15:40,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:15:40,354 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;@20033f40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:15:40,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:15:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 50 states have (on average 1.92) internal successors, (96), 51 states have internal predecessors, (96), 0 states have call successors, (0), 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-21 21:15:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-21 21:15:40,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:40,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:40,362 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:40,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:40,366 INFO L85 PathProgramCache]: Analyzing trace with hash 792943379, now seen corresponding path program 1 times [2024-11-21 21:15:40,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:40,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357875336] [2024-11-21 21:15:40,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:40,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:40,599 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-21 21:15:40,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:40,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357875336] [2024-11-21 21:15:40,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357875336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:40,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:40,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:40,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691481661] [2024-11-21 21:15:40,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:40,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:40,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:40,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:40,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:40,625 INFO L87 Difference]: Start difference. First operand has 52 states, 50 states have (on average 1.92) internal successors, (96), 51 states have internal predecessors, (96), 0 states have call successors, (0), 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.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:15:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:40,696 INFO L93 Difference]: Finished difference Result 105 states and 192 transitions. [2024-11-21 21:15:40,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:40,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-21 21:15:40,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:40,706 INFO L225 Difference]: With dead ends: 105 [2024-11-21 21:15:40,706 INFO L226 Difference]: Without dead ends: 93 [2024-11-21 21:15:40,708 INFO L431 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-21 21:15:40,711 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 70 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 185 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-21 21:15:40,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 185 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-21 21:15:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2024-11-21 21:15:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 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-21 21:15:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2024-11-21 21:15:40,749 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2024-11-21 21:15:40,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:40,749 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2024-11-21 21:15:40,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:15:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2024-11-21 21:15:40,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-21 21:15:40,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:40,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:40,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 21:15:40,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:40,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:40,751 INFO L85 PathProgramCache]: Analyzing trace with hash -795404523, now seen corresponding path program 1 times [2024-11-21 21:15:40,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:40,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466201698] [2024-11-21 21:15:40,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:40,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:40,819 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-21 21:15:40,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:40,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466201698] [2024-11-21 21:15:40,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466201698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:40,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:40,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:40,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415698922] [2024-11-21 21:15:40,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:40,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:40,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:40,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:40,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:40,825 INFO L87 Difference]: Start difference. First operand 63 states and 118 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:15:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:40,845 INFO L93 Difference]: Finished difference Result 154 states and 289 transitions. [2024-11-21 21:15:40,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:40,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-21 21:15:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:40,848 INFO L225 Difference]: With dead ends: 154 [2024-11-21 21:15:40,849 INFO L226 Difference]: Without dead ends: 93 [2024-11-21 21:15:40,849 INFO L431 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-21 21:15:40,854 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 199 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-21 21:15:40,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 199 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-21 21:15:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-11-21 21:15:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 0 states have call successors, (0), 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-21 21:15:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 170 transitions. [2024-11-21 21:15:40,862 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 170 transitions. Word has length 21 [2024-11-21 21:15:40,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:40,863 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 170 transitions. [2024-11-21 21:15:40,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:15:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 170 transitions. [2024-11-21 21:15:40,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-21 21:15:40,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:40,864 INFO L215 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-21 21:15:40,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 21:15:40,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:40,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:40,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1188346975, now seen corresponding path program 1 times [2024-11-21 21:15:40,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:40,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702020670] [2024-11-21 21:15:40,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:40,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:40,941 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-21 21:15:40,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:40,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702020670] [2024-11-21 21:15:40,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702020670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:40,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:40,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:40,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053356945] [2024-11-21 21:15:40,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:40,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:40,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:40,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:40,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:40,944 INFO L87 Difference]: Start difference. First operand 91 states and 170 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-21 21:15:40,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:40,958 INFO L93 Difference]: Finished difference Result 141 states and 258 transitions. [2024-11-21 21:15:40,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:40,959 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-21 21:15:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:40,960 INFO L225 Difference]: With dead ends: 141 [2024-11-21 21:15:40,960 INFO L226 Difference]: Without dead ends: 96 [2024-11-21 21:15:40,960 INFO L431 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-21 21:15:40,961 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 70 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 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-21 21:15:40,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-21 21:15:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2024-11-21 21:15:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 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-21 21:15:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2024-11-21 21:15:40,971 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 22 [2024-11-21 21:15:40,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:40,972 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2024-11-21 21:15:40,972 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-21 21:15:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2024-11-21 21:15:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-21 21:15:40,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:40,973 INFO L215 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-21 21:15:40,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 21:15:40,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:40,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:40,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1112475615, now seen corresponding path program 1 times [2024-11-21 21:15:40,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:40,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68211178] [2024-11-21 21:15:40,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:40,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:41,019 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-21 21:15:41,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:41,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68211178] [2024-11-21 21:15:41,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68211178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:41,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:41,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:41,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839718437] [2024-11-21 21:15:41,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:41,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:41,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:41,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:41,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:41,022 INFO L87 Difference]: Start difference. First operand 94 states and 172 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-21 21:15:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:41,039 INFO L93 Difference]: Finished difference Result 181 states and 333 transitions. [2024-11-21 21:15:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:41,040 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-21 21:15:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:41,041 INFO L225 Difference]: With dead ends: 181 [2024-11-21 21:15:41,044 INFO L226 Difference]: Without dead ends: 179 [2024-11-21 21:15:41,044 INFO L431 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-21 21:15:41,045 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 65 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 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-21 21:15:41,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:41,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-21 21:15:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 125. [2024-11-21 21:15:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 0 states have call successors, (0), 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-21 21:15:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 229 transitions. [2024-11-21 21:15:41,061 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 229 transitions. Word has length 22 [2024-11-21 21:15:41,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:41,061 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 229 transitions. [2024-11-21 21:15:41,061 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-21 21:15:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 229 transitions. [2024-11-21 21:15:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-21 21:15:41,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:41,064 INFO L215 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-21 21:15:41,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 21:15:41,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:41,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:41,065 INFO L85 PathProgramCache]: Analyzing trace with hash -475872287, now seen corresponding path program 1 times [2024-11-21 21:15:41,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:41,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292548324] [2024-11-21 21:15:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:41,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:41,108 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-21 21:15:41,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292548324] [2024-11-21 21:15:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292548324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:41,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:41,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579425021] [2024-11-21 21:15:41,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:41,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:41,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:41,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:41,112 INFO L87 Difference]: Start difference. First operand 125 states and 229 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-21 21:15:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:41,130 INFO L93 Difference]: Finished difference Result 301 states and 555 transitions. [2024-11-21 21:15:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:41,131 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-21 21:15:41,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:41,132 INFO L225 Difference]: With dead ends: 301 [2024-11-21 21:15:41,134 INFO L226 Difference]: Without dead ends: 181 [2024-11-21 21:15:41,134 INFO L431 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-21 21:15:41,135 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 200 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-21 21:15:41,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 200 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-21 21:15:41,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2024-11-21 21:15:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 0 states have call successors, (0), 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-21 21:15:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 327 transitions. [2024-11-21 21:15:41,145 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 327 transitions. Word has length 22 [2024-11-21 21:15:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:41,145 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 327 transitions. [2024-11-21 21:15:41,146 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-21 21:15:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 327 transitions. [2024-11-21 21:15:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-21 21:15:41,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:41,147 INFO L215 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-21 21:15:41,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 21:15:41,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:41,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:41,148 INFO L85 PathProgramCache]: Analyzing trace with hash 127218090, now seen corresponding path program 1 times [2024-11-21 21:15:41,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:41,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224874555] [2024-11-21 21:15:41,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:41,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:41,174 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-21 21:15:41,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:41,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224874555] [2024-11-21 21:15:41,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224874555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:41,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:41,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:41,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988405401] [2024-11-21 21:15:41,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:41,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:41,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:41,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:41,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:41,178 INFO L87 Difference]: Start difference. First operand 179 states and 327 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-21 21:15:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:41,194 INFO L93 Difference]: Finished difference Result 270 states and 490 transitions. [2024-11-21 21:15:41,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:41,195 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-21 21:15:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:41,195 INFO L225 Difference]: With dead ends: 270 [2024-11-21 21:15:41,195 INFO L226 Difference]: Without dead ends: 183 [2024-11-21 21:15:41,196 INFO L431 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-21 21:15:41,197 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 69 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 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-21 21:15:41,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 220 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:41,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-21 21:15:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2024-11-21 21:15:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 0 states have call successors, (0), 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-21 21:15:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 327 transitions. [2024-11-21 21:15:41,214 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 327 transitions. Word has length 23 [2024-11-21 21:15:41,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:41,215 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 327 transitions. [2024-11-21 21:15:41,215 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-21 21:15:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 327 transitions. [2024-11-21 21:15:41,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-21 21:15:41,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:41,217 INFO L215 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-21 21:15:41,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 21:15:41,218 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:41,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:41,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1866926616, now seen corresponding path program 1 times [2024-11-21 21:15:41,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:41,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334147507] [2024-11-21 21:15:41,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:41,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:41,248 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-21 21:15:41,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:41,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334147507] [2024-11-21 21:15:41,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334147507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:41,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:41,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:41,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381871145] [2024-11-21 21:15:41,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:41,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:41,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:41,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:41,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:41,251 INFO L87 Difference]: Start difference. First operand 181 states and 327 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-21 21:15:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:41,265 INFO L93 Difference]: Finished difference Result 525 states and 953 transitions. [2024-11-21 21:15:41,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:41,266 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-21 21:15:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:41,267 INFO L225 Difference]: With dead ends: 525 [2024-11-21 21:15:41,267 INFO L226 Difference]: Without dead ends: 351 [2024-11-21 21:15:41,268 INFO L431 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-21 21:15:41,268 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 175 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-21 21:15:41,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-21 21:15:41,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2024-11-21 21:15:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 0 states have call successors, (0), 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-21 21:15:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 627 transitions. [2024-11-21 21:15:41,281 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 627 transitions. Word has length 23 [2024-11-21 21:15:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:41,281 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 627 transitions. [2024-11-21 21:15:41,281 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-21 21:15:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 627 transitions. [2024-11-21 21:15:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-21 21:15:41,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:41,285 INFO L215 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-21 21:15:41,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 21:15:41,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:41,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:41,285 INFO L85 PathProgramCache]: Analyzing trace with hash -278578714, now seen corresponding path program 1 times [2024-11-21 21:15:41,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:41,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820568013] [2024-11-21 21:15:41,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:41,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:41,327 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-21 21:15:41,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:41,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820568013] [2024-11-21 21:15:41,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820568013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:41,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:41,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:41,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101914165] [2024-11-21 21:15:41,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:41,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:41,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:41,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:41,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:41,331 INFO L87 Difference]: Start difference. First operand 349 states and 627 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-21 21:15:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:41,348 INFO L93 Difference]: Finished difference Result 449 states and 813 transitions. [2024-11-21 21:15:41,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:41,349 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-21 21:15:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:41,350 INFO L225 Difference]: With dead ends: 449 [2024-11-21 21:15:41,350 INFO L226 Difference]: Without dead ends: 447 [2024-11-21 21:15:41,351 INFO L431 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-21 21:15:41,351 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 62 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 242 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-21 21:15:41,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 242 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:41,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-21 21:15:41,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 349. [2024-11-21 21:15:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 0 states have call successors, (0), 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-21 21:15:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 623 transitions. [2024-11-21 21:15:41,367 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 623 transitions. Word has length 23 [2024-11-21 21:15:41,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:41,367 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 623 transitions. [2024-11-21 21:15:41,367 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-21 21:15:41,368 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 623 transitions. [2024-11-21 21:15:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-21 21:15:41,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:41,368 INFO L215 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-21 21:15:41,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 21:15:41,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:41,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2039937514, now seen corresponding path program 1 times [2024-11-21 21:15:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:41,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646006913] [2024-11-21 21:15:41,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:41,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:41,399 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-21 21:15:41,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:41,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646006913] [2024-11-21 21:15:41,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646006913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:41,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:41,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:41,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072118758] [2024-11-21 21:15:41,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:41,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:41,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:41,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:41,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:41,402 INFO L87 Difference]: Start difference. First operand 349 states and 623 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-21 21:15:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:41,420 INFO L93 Difference]: Finished difference Result 661 states and 1193 transitions. [2024-11-21 21:15:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:41,420 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-21 21:15:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:41,422 INFO L225 Difference]: With dead ends: 661 [2024-11-21 21:15:41,423 INFO L226 Difference]: Without dead ends: 659 [2024-11-21 21:15:41,423 INFO L431 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-21 21:15:41,425 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 59 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 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-21 21:15:41,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-21 21:15:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 481. [2024-11-21 21:15:41,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 0 states have call successors, (0), 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-21 21:15:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 847 transitions. [2024-11-21 21:15:41,436 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 847 transitions. Word has length 24 [2024-11-21 21:15:41,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:41,437 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 847 transitions. [2024-11-21 21:15:41,437 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-21 21:15:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 847 transitions. [2024-11-21 21:15:41,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-21 21:15:41,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:41,438 INFO L215 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-21 21:15:41,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 21:15:41,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:41,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:41,439 INFO L85 PathProgramCache]: Analyzing trace with hash 666681880, now seen corresponding path program 1 times [2024-11-21 21:15:41,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:41,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607224805] [2024-11-21 21:15:41,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:41,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:41,460 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-21 21:15:41,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:41,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607224805] [2024-11-21 21:15:41,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607224805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:41,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:41,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:41,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372182699] [2024-11-21 21:15:41,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:41,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:41,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:41,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:41,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:41,462 INFO L87 Difference]: Start difference. First operand 481 states and 847 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-21 21:15:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:41,481 INFO L93 Difference]: Finished difference Result 1157 states and 2049 transitions. [2024-11-21 21:15:41,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:41,482 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-21 21:15:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:41,484 INFO L225 Difference]: With dead ends: 1157 [2024-11-21 21:15:41,484 INFO L226 Difference]: Without dead ends: 683 [2024-11-21 21:15:41,484 INFO L431 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-21 21:15:41,485 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 202 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-21 21:15:41,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 202 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-21 21:15:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2024-11-21 21:15:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 0 states have call successors, (0), 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-21 21:15:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1195 transitions. [2024-11-21 21:15:41,510 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1195 transitions. Word has length 24 [2024-11-21 21:15:41,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:41,511 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1195 transitions. [2024-11-21 21:15:41,511 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-21 21:15:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1195 transitions. [2024-11-21 21:15:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-21 21:15:41,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:41,512 INFO L215 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-21 21:15:41,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 21:15:41,512 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:41,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1186659581, now seen corresponding path program 1 times [2024-11-21 21:15:41,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:41,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471487235] [2024-11-21 21:15:41,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:41,534 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-21 21:15:41,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:41,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471487235] [2024-11-21 21:15:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471487235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:41,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:41,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161965559] [2024-11-21 21:15:41,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:41,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:41,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:41,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:41,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:41,536 INFO L87 Difference]: Start difference. First operand 681 states and 1195 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-21 21:15:41,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:41,552 INFO L93 Difference]: Finished difference Result 1029 states and 1801 transitions. [2024-11-21 21:15:41,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:41,552 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-21 21:15:41,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:41,554 INFO L225 Difference]: With dead ends: 1029 [2024-11-21 21:15:41,554 INFO L226 Difference]: Without dead ends: 695 [2024-11-21 21:15:41,555 INFO L431 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-21 21:15:41,555 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 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-21 21:15:41,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-21 21:15:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2024-11-21 21:15:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 0 states have call successors, (0), 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-21 21:15:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1203 transitions. [2024-11-21 21:15:41,568 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1203 transitions. Word has length 25 [2024-11-21 21:15:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:41,568 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1203 transitions. [2024-11-21 21:15:41,569 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-21 21:15:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1203 transitions. [2024-11-21 21:15:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-21 21:15:41,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:41,571 INFO L215 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-21 21:15:41,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 21:15:41,571 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:41,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:41,571 INFO L85 PathProgramCache]: Analyzing trace with hash -807485125, now seen corresponding path program 1 times [2024-11-21 21:15:41,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:41,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337522513] [2024-11-21 21:15:41,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:41,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:41,599 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-21 21:15:41,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:41,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337522513] [2024-11-21 21:15:41,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337522513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:41,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:41,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:41,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543543453] [2024-11-21 21:15:41,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:41,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:41,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:41,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:41,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:41,600 INFO L87 Difference]: Start difference. First operand 693 states and 1203 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-21 21:15:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:41,619 INFO L93 Difference]: Finished difference Result 1289 states and 2269 transitions. [2024-11-21 21:15:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:41,619 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-21 21:15:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:41,623 INFO L225 Difference]: With dead ends: 1289 [2024-11-21 21:15:41,624 INFO L226 Difference]: Without dead ends: 1287 [2024-11-21 21:15:41,625 INFO L431 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-21 21:15:41,625 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 56 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 167 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-21 21:15:41,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2024-11-21 21:15:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 965. [2024-11-21 21:15:41,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 0 states have call successors, (0), 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-21 21:15:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1643 transitions. [2024-11-21 21:15:41,643 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1643 transitions. Word has length 25 [2024-11-21 21:15:41,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:41,643 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1643 transitions. [2024-11-21 21:15:41,643 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-21 21:15:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1643 transitions. [2024-11-21 21:15:41,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-21 21:15:41,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:41,644 INFO L215 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-21 21:15:41,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 21:15:41,644 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:41,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:41,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1899134269, now seen corresponding path program 1 times [2024-11-21 21:15:41,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:41,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132443787] [2024-11-21 21:15:41,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:41,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:41,664 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-21 21:15:41,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:41,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132443787] [2024-11-21 21:15:41,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132443787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:41,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:41,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:41,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037062871] [2024-11-21 21:15:41,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:41,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:41,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:41,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:41,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:41,666 INFO L87 Difference]: Start difference. First operand 965 states and 1643 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-21 21:15:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:41,690 INFO L93 Difference]: Finished difference Result 2297 states and 3933 transitions. [2024-11-21 21:15:41,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:41,690 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-21 21:15:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:41,694 INFO L225 Difference]: With dead ends: 2297 [2024-11-21 21:15:41,694 INFO L226 Difference]: Without dead ends: 1351 [2024-11-21 21:15:41,694 INFO L431 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-21 21:15:41,696 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 203 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-21 21:15:41,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 203 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:41,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-11-21 21:15:41,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1349. [2024-11-21 21:15:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 0 states have call successors, (0), 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-21 21:15:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2291 transitions. [2024-11-21 21:15:41,721 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2291 transitions. Word has length 25 [2024-11-21 21:15:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:41,721 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 2291 transitions. [2024-11-21 21:15:41,722 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-21 21:15:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2291 transitions. [2024-11-21 21:15:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-21 21:15:41,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:41,723 INFO L215 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-21 21:15:41,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-21 21:15:41,723 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:41,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:41,723 INFO L85 PathProgramCache]: Analyzing trace with hash 737978317, now seen corresponding path program 1 times [2024-11-21 21:15:41,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:41,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391625970] [2024-11-21 21:15:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:41,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:41,743 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-21 21:15:41,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:41,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391625970] [2024-11-21 21:15:41,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391625970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:41,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:41,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:41,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783812382] [2024-11-21 21:15:41,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:41,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:41,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:41,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:41,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:41,745 INFO L87 Difference]: Start difference. First operand 1349 states and 2291 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-21 21:15:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:41,766 INFO L93 Difference]: Finished difference Result 2025 states and 3429 transitions. [2024-11-21 21:15:41,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:41,767 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-21 21:15:41,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:41,770 INFO L225 Difference]: With dead ends: 2025 [2024-11-21 21:15:41,770 INFO L226 Difference]: Without dead ends: 1367 [2024-11-21 21:15:41,771 INFO L431 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-21 21:15:41,771 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 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-21 21:15:41,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:41,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-11-21 21:15:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1365. [2024-11-21 21:15:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 0 states have call successors, (0), 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-21 21:15:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2291 transitions. [2024-11-21 21:15:41,794 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2291 transitions. Word has length 26 [2024-11-21 21:15:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:41,794 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 2291 transitions. [2024-11-21 21:15:41,794 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-21 21:15:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2291 transitions. [2024-11-21 21:15:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-21 21:15:41,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:41,795 INFO L215 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-21 21:15:41,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-21 21:15:41,795 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:41,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1256166389, now seen corresponding path program 1 times [2024-11-21 21:15:41,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:41,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144914567] [2024-11-21 21:15:41,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:41,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:41,814 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-21 21:15:41,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:41,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144914567] [2024-11-21 21:15:41,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144914567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:41,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:41,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65676840] [2024-11-21 21:15:41,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:41,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:41,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:41,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:41,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:41,815 INFO L87 Difference]: Start difference. First operand 1365 states and 2291 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-21 21:15:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:41,842 INFO L93 Difference]: Finished difference Result 2505 states and 4277 transitions. [2024-11-21 21:15:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:41,842 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-21 21:15:41,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:41,848 INFO L225 Difference]: With dead ends: 2505 [2024-11-21 21:15:41,848 INFO L226 Difference]: Without dead ends: 2503 [2024-11-21 21:15:41,849 INFO L431 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-21 21:15:41,849 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 53 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 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-21 21:15:41,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2024-11-21 21:15:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1925. [2024-11-21 21:15:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 0 states have call successors, (0), 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-21 21:15:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3155 transitions. [2024-11-21 21:15:41,905 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3155 transitions. Word has length 26 [2024-11-21 21:15:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:41,906 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 3155 transitions. [2024-11-21 21:15:41,906 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-21 21:15:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3155 transitions. [2024-11-21 21:15:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-21 21:15:41,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:41,907 INFO L215 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-21 21:15:41,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-21 21:15:41,907 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:41,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:41,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1450453005, now seen corresponding path program 1 times [2024-11-21 21:15:41,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:41,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954280080] [2024-11-21 21:15:41,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:41,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:41,923 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-21 21:15:41,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:41,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954280080] [2024-11-21 21:15:41,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954280080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:41,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:41,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:41,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942912905] [2024-11-21 21:15:41,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:41,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:41,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:41,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:41,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:41,925 INFO L87 Difference]: Start difference. First operand 1925 states and 3155 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-21 21:15:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:41,961 INFO L93 Difference]: Finished difference Result 4553 states and 7509 transitions. [2024-11-21 21:15:41,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:41,961 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-21 21:15:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:41,967 INFO L225 Difference]: With dead ends: 4553 [2024-11-21 21:15:41,967 INFO L226 Difference]: Without dead ends: 2663 [2024-11-21 21:15:41,969 INFO L431 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-21 21:15:41,969 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 204 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-21 21:15:41,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 204 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2024-11-21 21:15:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2661. [2024-11-21 21:15:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 0 states have call successors, (0), 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-21 21:15:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 4355 transitions. [2024-11-21 21:15:42,015 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 4355 transitions. Word has length 26 [2024-11-21 21:15:42,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:42,016 INFO L471 AbstractCegarLoop]: Abstraction has 2661 states and 4355 transitions. [2024-11-21 21:15:42,016 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-21 21:15:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 4355 transitions. [2024-11-21 21:15:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-21 21:15:42,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:42,017 INFO L215 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-21 21:15:42,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-21 21:15:42,018 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:42,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:42,018 INFO L85 PathProgramCache]: Analyzing trace with hash -286238638, now seen corresponding path program 1 times [2024-11-21 21:15:42,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:42,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214612887] [2024-11-21 21:15:42,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:42,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:42,035 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-21 21:15:42,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:42,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214612887] [2024-11-21 21:15:42,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214612887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:42,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:42,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:42,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061614827] [2024-11-21 21:15:42,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:42,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:42,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:42,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:42,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:42,038 INFO L87 Difference]: Start difference. First operand 2661 states and 4355 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-21 21:15:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:42,072 INFO L93 Difference]: Finished difference Result 3993 states and 6517 transitions. [2024-11-21 21:15:42,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:42,073 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-21 21:15:42,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:42,079 INFO L225 Difference]: With dead ends: 3993 [2024-11-21 21:15:42,079 INFO L226 Difference]: Without dead ends: 2695 [2024-11-21 21:15:42,080 INFO L431 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-21 21:15:42,081 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 65 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 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-21 21:15:42,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2024-11-21 21:15:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2693. [2024-11-21 21:15:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 0 states have call successors, (0), 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-21 21:15:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 4355 transitions. [2024-11-21 21:15:42,136 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 4355 transitions. Word has length 27 [2024-11-21 21:15:42,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:42,137 INFO L471 AbstractCegarLoop]: Abstraction has 2693 states and 4355 transitions. [2024-11-21 21:15:42,137 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-21 21:15:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 4355 transitions. [2024-11-21 21:15:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-21 21:15:42,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:42,138 INFO L215 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-21 21:15:42,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-21 21:15:42,139 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:42,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:42,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2014583952, now seen corresponding path program 1 times [2024-11-21 21:15:42,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:42,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937198947] [2024-11-21 21:15:42,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:42,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:42,158 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-21 21:15:42,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:42,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937198947] [2024-11-21 21:15:42,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937198947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:42,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:42,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:42,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47363136] [2024-11-21 21:15:42,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:42,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:42,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:42,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:42,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:42,160 INFO L87 Difference]: Start difference. First operand 2693 states and 4355 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-21 21:15:42,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:42,236 INFO L93 Difference]: Finished difference Result 4873 states and 8037 transitions. [2024-11-21 21:15:42,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:42,237 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-21 21:15:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:42,247 INFO L225 Difference]: With dead ends: 4873 [2024-11-21 21:15:42,248 INFO L226 Difference]: Without dead ends: 4871 [2024-11-21 21:15:42,248 INFO L431 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-21 21:15:42,249 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 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-21 21:15:42,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:42,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2024-11-21 21:15:42,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 3845. [2024-11-21 21:15:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 0 states have call successors, (0), 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-21 21:15:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 6051 transitions. [2024-11-21 21:15:42,322 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 6051 transitions. Word has length 27 [2024-11-21 21:15:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:42,322 INFO L471 AbstractCegarLoop]: Abstraction has 3845 states and 6051 transitions. [2024-11-21 21:15:42,323 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-21 21:15:42,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 6051 transitions. [2024-11-21 21:15:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-21 21:15:42,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:42,325 INFO L215 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-21 21:15:42,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-21 21:15:42,325 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:42,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:42,326 INFO L85 PathProgramCache]: Analyzing trace with hash 426236050, now seen corresponding path program 1 times [2024-11-21 21:15:42,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:42,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453101640] [2024-11-21 21:15:42,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:42,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:42,343 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-21 21:15:42,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:42,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453101640] [2024-11-21 21:15:42,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453101640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:42,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:42,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:42,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767258957] [2024-11-21 21:15:42,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:42,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:42,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:42,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:42,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:42,344 INFO L87 Difference]: Start difference. First operand 3845 states and 6051 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-21 21:15:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:42,416 INFO L93 Difference]: Finished difference Result 9033 states and 14309 transitions. [2024-11-21 21:15:42,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:42,417 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-21 21:15:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:42,436 INFO L225 Difference]: With dead ends: 9033 [2024-11-21 21:15:42,436 INFO L226 Difference]: Without dead ends: 5255 [2024-11-21 21:15:42,442 INFO L431 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-21 21:15:42,443 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 205 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-21 21:15:42,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2024-11-21 21:15:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 5253. [2024-11-21 21:15:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 0 states have call successors, (0), 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-21 21:15:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5253 states to 5253 states and 8259 transitions. [2024-11-21 21:15:42,592 INFO L78 Accepts]: Start accepts. Automaton has 5253 states and 8259 transitions. Word has length 27 [2024-11-21 21:15:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:42,593 INFO L471 AbstractCegarLoop]: Abstraction has 5253 states and 8259 transitions. [2024-11-21 21:15:42,593 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-21 21:15:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5253 states and 8259 transitions. [2024-11-21 21:15:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-21 21:15:42,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:42,598 INFO L215 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-21 21:15:42,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-21 21:15:42,599 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:42,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:42,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1972192830, now seen corresponding path program 1 times [2024-11-21 21:15:42,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:42,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649681791] [2024-11-21 21:15:42,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:42,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:42,622 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-21 21:15:42,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:42,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649681791] [2024-11-21 21:15:42,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649681791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:42,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:42,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:42,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100418059] [2024-11-21 21:15:42,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:42,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:42,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:42,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:42,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:42,624 INFO L87 Difference]: Start difference. First operand 5253 states and 8259 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-21 21:15:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:42,703 INFO L93 Difference]: Finished difference Result 7881 states and 12357 transitions. [2024-11-21 21:15:42,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:42,704 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-21 21:15:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:42,716 INFO L225 Difference]: With dead ends: 7881 [2024-11-21 21:15:42,716 INFO L226 Difference]: Without dead ends: 5319 [2024-11-21 21:15:42,720 INFO L431 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-21 21:15:42,721 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 64 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 200 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-21 21:15:42,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 200 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:42,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2024-11-21 21:15:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 5317. [2024-11-21 21:15:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 0 states have call successors, (0), 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-21 21:15:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 8259 transitions. [2024-11-21 21:15:42,825 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 8259 transitions. Word has length 28 [2024-11-21 21:15:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:42,825 INFO L471 AbstractCegarLoop]: Abstraction has 5317 states and 8259 transitions. [2024-11-21 21:15:42,825 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-21 21:15:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 8259 transitions. [2024-11-21 21:15:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-21 21:15:42,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:42,829 INFO L215 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-21 21:15:42,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-21 21:15:42,829 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:42,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:42,829 INFO L85 PathProgramCache]: Analyzing trace with hash 328629760, now seen corresponding path program 1 times [2024-11-21 21:15:42,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:42,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222517127] [2024-11-21 21:15:42,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:42,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:42,845 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-21 21:15:42,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:42,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222517127] [2024-11-21 21:15:42,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222517127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:42,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:42,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:42,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327807014] [2024-11-21 21:15:42,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:42,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:42,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:42,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:42,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:42,847 INFO L87 Difference]: Start difference. First operand 5317 states and 8259 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-21 21:15:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:42,961 INFO L93 Difference]: Finished difference Result 9481 states and 15045 transitions. [2024-11-21 21:15:42,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:42,961 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-21 21:15:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:42,974 INFO L225 Difference]: With dead ends: 9481 [2024-11-21 21:15:42,974 INFO L226 Difference]: Without dead ends: 9479 [2024-11-21 21:15:42,975 INFO L431 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-21 21:15:42,976 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 47 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 161 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-21 21:15:42,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:42,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9479 states. [2024-11-21 21:15:43,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9479 to 7685. [2024-11-21 21:15:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 0 states have call successors, (0), 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-21 21:15:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7685 states to 7685 states and 11587 transitions. [2024-11-21 21:15:43,113 INFO L78 Accepts]: Start accepts. Automaton has 7685 states and 11587 transitions. Word has length 28 [2024-11-21 21:15:43,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:43,113 INFO L471 AbstractCegarLoop]: Abstraction has 7685 states and 11587 transitions. [2024-11-21 21:15:43,113 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-21 21:15:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7685 states and 11587 transitions. [2024-11-21 21:15:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-21 21:15:43,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:43,119 INFO L215 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-21 21:15:43,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-21 21:15:43,119 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:43,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1259718142, now seen corresponding path program 1 times [2024-11-21 21:15:43,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:43,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118854235] [2024-11-21 21:15:43,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:43,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:43,143 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-21 21:15:43,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:43,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118854235] [2024-11-21 21:15:43,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118854235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:43,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:43,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:43,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099566373] [2024-11-21 21:15:43,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:43,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:43,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:43,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:43,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:43,145 INFO L87 Difference]: Start difference. First operand 7685 states and 11587 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-21 21:15:43,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:43,265 INFO L93 Difference]: Finished difference Result 17929 states and 27205 transitions. [2024-11-21 21:15:43,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:43,266 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-21 21:15:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:43,278 INFO L225 Difference]: With dead ends: 17929 [2024-11-21 21:15:43,278 INFO L226 Difference]: Without dead ends: 10375 [2024-11-21 21:15:43,284 INFO L431 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-21 21:15:43,285 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 61 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 206 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-21 21:15:43,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 206 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10375 states. [2024-11-21 21:15:43,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10375 to 10373. [2024-11-21 21:15:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 0 states have call successors, (0), 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-21 21:15:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10373 states to 10373 states and 15619 transitions. [2024-11-21 21:15:43,495 INFO L78 Accepts]: Start accepts. Automaton has 10373 states and 15619 transitions. Word has length 28 [2024-11-21 21:15:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:43,495 INFO L471 AbstractCegarLoop]: Abstraction has 10373 states and 15619 transitions. [2024-11-21 21:15:43,495 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-21 21:15:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 10373 states and 15619 transitions. [2024-11-21 21:15:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-21 21:15:43,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:43,501 INFO L215 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-21 21:15:43,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-21 21:15:43,502 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:43,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:43,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1597802407, now seen corresponding path program 1 times [2024-11-21 21:15:43,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:43,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061161549] [2024-11-21 21:15:43,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:43,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:43,518 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-21 21:15:43,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:43,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061161549] [2024-11-21 21:15:43,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061161549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:43,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:43,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:43,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622669092] [2024-11-21 21:15:43,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:43,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:43,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:43,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:43,520 INFO L87 Difference]: Start difference. First operand 10373 states and 15619 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-21 21:15:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:43,619 INFO L93 Difference]: Finished difference Result 15561 states and 23365 transitions. [2024-11-21 21:15:43,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:43,619 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-21 21:15:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:43,634 INFO L225 Difference]: With dead ends: 15561 [2024-11-21 21:15:43,634 INFO L226 Difference]: Without dead ends: 10503 [2024-11-21 21:15:43,642 INFO L431 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-21 21:15:43,642 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 63 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 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-21 21:15:43,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10503 states. [2024-11-21 21:15:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10503 to 10501. [2024-11-21 21:15:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 0 states have call successors, (0), 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-21 21:15:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10501 states to 10501 states and 15619 transitions. [2024-11-21 21:15:43,897 INFO L78 Accepts]: Start accepts. Automaton has 10501 states and 15619 transitions. Word has length 29 [2024-11-21 21:15:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:43,898 INFO L471 AbstractCegarLoop]: Abstraction has 10501 states and 15619 transitions. [2024-11-21 21:15:43,898 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-21 21:15:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 10501 states and 15619 transitions. [2024-11-21 21:15:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-21 21:15:43,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:43,905 INFO L215 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-21 21:15:43,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-21 21:15:43,906 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:43,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:43,906 INFO L85 PathProgramCache]: Analyzing trace with hash -396342299, now seen corresponding path program 1 times [2024-11-21 21:15:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:43,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522555185] [2024-11-21 21:15:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:43,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:43,925 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-21 21:15:43,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:43,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522555185] [2024-11-21 21:15:43,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522555185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:43,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:43,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:43,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167680484] [2024-11-21 21:15:43,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:43,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:43,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:43,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:43,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:43,927 INFO L87 Difference]: Start difference. First operand 10501 states and 15619 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-21 21:15:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:44,099 INFO L93 Difference]: Finished difference Result 18441 states and 28037 transitions. [2024-11-21 21:15:44,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:44,100 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-21 21:15:44,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:44,126 INFO L225 Difference]: With dead ends: 18441 [2024-11-21 21:15:44,127 INFO L226 Difference]: Without dead ends: 18439 [2024-11-21 21:15:44,133 INFO L431 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-21 21:15:44,134 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 44 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 159 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-21 21:15:44,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18439 states. [2024-11-21 21:15:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18439 to 15365. [2024-11-21 21:15:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15365 states, 15364 states have (on average 1.4414865920333246) internal successors, (22147), 15364 states have internal predecessors, (22147), 0 states have call successors, (0), 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-21 21:15:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15365 states to 15365 states and 22147 transitions. [2024-11-21 21:15:44,418 INFO L78 Accepts]: Start accepts. Automaton has 15365 states and 22147 transitions. Word has length 29 [2024-11-21 21:15:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:44,418 INFO L471 AbstractCegarLoop]: Abstraction has 15365 states and 22147 transitions. [2024-11-21 21:15:44,418 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-21 21:15:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 15365 states and 22147 transitions. [2024-11-21 21:15:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-21 21:15:44,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:44,429 INFO L215 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-21 21:15:44,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-21 21:15:44,429 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:44,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:44,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1984690201, now seen corresponding path program 1 times [2024-11-21 21:15:44,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:44,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559022586] [2024-11-21 21:15:44,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:44,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:44,452 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-21 21:15:44,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:44,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559022586] [2024-11-21 21:15:44,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559022586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:44,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:44,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:44,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046535325] [2024-11-21 21:15:44,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:44,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:44,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:44,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:44,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:44,453 INFO L87 Difference]: Start difference. First operand 15365 states and 22147 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-21 21:15:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:44,670 INFO L93 Difference]: Finished difference Result 35593 states and 51589 transitions. [2024-11-21 21:15:44,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:44,671 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-21 21:15:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:44,695 INFO L225 Difference]: With dead ends: 35593 [2024-11-21 21:15:44,696 INFO L226 Difference]: Without dead ends: 20487 [2024-11-21 21:15:44,708 INFO L431 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-21 21:15:44,708 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 60 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 207 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-21 21:15:44,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 207 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20487 states. [2024-11-21 21:15:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20487 to 20485. [2024-11-21 21:15:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20485 states, 20484 states have (on average 1.4373657488771725) internal successors, (29443), 20484 states have internal predecessors, (29443), 0 states have call successors, (0), 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-21 21:15:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20485 states to 20485 states and 29443 transitions. [2024-11-21 21:15:45,045 INFO L78 Accepts]: Start accepts. Automaton has 20485 states and 29443 transitions. Word has length 29 [2024-11-21 21:15:45,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:45,045 INFO L471 AbstractCegarLoop]: Abstraction has 20485 states and 29443 transitions. [2024-11-21 21:15:45,045 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-21 21:15:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 20485 states and 29443 transitions. [2024-11-21 21:15:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-21 21:15:45,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:45,057 INFO L215 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-21 21:15:45,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-21 21:15:45,057 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:45,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:45,058 INFO L85 PathProgramCache]: Analyzing trace with hash 598505399, now seen corresponding path program 1 times [2024-11-21 21:15:45,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:45,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400484841] [2024-11-21 21:15:45,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:45,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:45,080 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-21 21:15:45,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:45,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400484841] [2024-11-21 21:15:45,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400484841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:45,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:45,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435213657] [2024-11-21 21:15:45,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:45,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:45,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:45,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:45,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:45,082 INFO L87 Difference]: Start difference. First operand 20485 states and 29443 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-21 21:15:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:45,368 INFO L93 Difference]: Finished difference Result 30729 states and 44037 transitions. [2024-11-21 21:15:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:45,368 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-21 21:15:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:45,399 INFO L225 Difference]: With dead ends: 30729 [2024-11-21 21:15:45,399 INFO L226 Difference]: Without dead ends: 20743 [2024-11-21 21:15:45,409 INFO L431 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-21 21:15:45,410 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 62 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 192 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-21 21:15:45,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20743 states. [2024-11-21 21:15:45,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20743 to 20741. [2024-11-21 21:15:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20741 states, 20740 states have (on average 1.4196239151398264) internal successors, (29443), 20740 states have internal predecessors, (29443), 0 states have call successors, (0), 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-21 21:15:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20741 states to 20741 states and 29443 transitions. [2024-11-21 21:15:45,864 INFO L78 Accepts]: Start accepts. Automaton has 20741 states and 29443 transitions. Word has length 30 [2024-11-21 21:15:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:45,864 INFO L471 AbstractCegarLoop]: Abstraction has 20741 states and 29443 transitions. [2024-11-21 21:15:45,864 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-21 21:15:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 20741 states and 29443 transitions. [2024-11-21 21:15:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-21 21:15:45,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:45,878 INFO L215 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-21 21:15:45,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-21 21:15:45,878 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:45,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1395639307, now seen corresponding path program 1 times [2024-11-21 21:15:45,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:45,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522157657] [2024-11-21 21:15:45,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:45,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:45,952 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-21 21:15:45,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:45,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522157657] [2024-11-21 21:15:45,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522157657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:45,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:45,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:45,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192120765] [2024-11-21 21:15:45,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:45,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:45,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:45,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:45,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:45,953 INFO L87 Difference]: Start difference. First operand 20741 states and 29443 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-21 21:15:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:46,204 INFO L93 Difference]: Finished difference Result 35849 states and 51973 transitions. [2024-11-21 21:15:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:46,205 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-21 21:15:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:46,260 INFO L225 Difference]: With dead ends: 35849 [2024-11-21 21:15:46,260 INFO L226 Difference]: Without dead ends: 35847 [2024-11-21 21:15:46,270 INFO L431 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-21 21:15:46,271 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 41 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 157 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-21 21:15:46,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35847 states. [2024-11-21 21:15:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35847 to 30725. [2024-11-21 21:15:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30725 states, 30724 states have (on average 1.3749186303866685) internal successors, (42243), 30724 states have internal predecessors, (42243), 0 states have call successors, (0), 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-21 21:15:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30725 states to 30725 states and 42243 transitions. [2024-11-21 21:15:46,773 INFO L78 Accepts]: Start accepts. Automaton has 30725 states and 42243 transitions. Word has length 30 [2024-11-21 21:15:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:46,774 INFO L471 AbstractCegarLoop]: Abstraction has 30725 states and 42243 transitions. [2024-11-21 21:15:46,774 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-21 21:15:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 30725 states and 42243 transitions. [2024-11-21 21:15:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-21 21:15:46,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:46,802 INFO L215 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-21 21:15:46,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-21 21:15:46,803 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:46,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:46,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1310980087, now seen corresponding path program 1 times [2024-11-21 21:15:46,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:46,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098544403] [2024-11-21 21:15:46,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:46,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:46,824 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-21 21:15:46,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:46,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098544403] [2024-11-21 21:15:46,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098544403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:46,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:46,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:46,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851133661] [2024-11-21 21:15:46,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:46,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:46,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:46,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:46,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:46,826 INFO L87 Difference]: Start difference. First operand 30725 states and 42243 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-21 21:15:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:47,197 INFO L93 Difference]: Finished difference Result 70665 states and 97541 transitions. [2024-11-21 21:15:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:47,198 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-21 21:15:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:47,235 INFO L225 Difference]: With dead ends: 70665 [2024-11-21 21:15:47,235 INFO L226 Difference]: Without dead ends: 40455 [2024-11-21 21:15:47,258 INFO L431 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-21 21:15:47,259 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 208 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-21 21:15:47,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:47,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40455 states. [2024-11-21 21:15:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40455 to 40453. [2024-11-21 21:15:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40453 states, 40452 states have (on average 1.367027588252744) internal successors, (55299), 40452 states have internal predecessors, (55299), 0 states have call successors, (0), 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-21 21:15:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40453 states to 40453 states and 55299 transitions. [2024-11-21 21:15:47,996 INFO L78 Accepts]: Start accepts. Automaton has 40453 states and 55299 transitions. Word has length 30 [2024-11-21 21:15:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:47,996 INFO L471 AbstractCegarLoop]: Abstraction has 40453 states and 55299 transitions. [2024-11-21 21:15:47,997 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-21 21:15:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 40453 states and 55299 transitions. [2024-11-21 21:15:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-21 21:15:48,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:48,019 INFO L215 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-21 21:15:48,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-21 21:15:48,019 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:48,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash -314930436, now seen corresponding path program 1 times [2024-11-21 21:15:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:48,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579715106] [2024-11-21 21:15:48,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:48,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:48,037 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-21 21:15:48,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579715106] [2024-11-21 21:15:48,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579715106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:48,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:48,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:48,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338496145] [2024-11-21 21:15:48,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:48,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:48,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:48,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:48,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:48,040 INFO L87 Difference]: Start difference. First operand 40453 states and 55299 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-21 21:15:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:48,567 INFO L93 Difference]: Finished difference Result 60681 states and 82693 transitions. [2024-11-21 21:15:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:48,568 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-21 21:15:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:48,618 INFO L225 Difference]: With dead ends: 60681 [2024-11-21 21:15:48,619 INFO L226 Difference]: Without dead ends: 40967 [2024-11-21 21:15:48,640 INFO L431 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-21 21:15:48,642 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 61 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 188 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-21 21:15:48,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40967 states. [2024-11-21 21:15:49,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40967 to 40965. [2024-11-21 21:15:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40965 states, 40964 states have (on average 1.3499414119714872) internal successors, (55299), 40964 states have internal predecessors, (55299), 0 states have call successors, (0), 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-21 21:15:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40965 states to 40965 states and 55299 transitions. [2024-11-21 21:15:49,461 INFO L78 Accepts]: Start accepts. Automaton has 40965 states and 55299 transitions. Word has length 31 [2024-11-21 21:15:49,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:49,462 INFO L471 AbstractCegarLoop]: Abstraction has 40965 states and 55299 transitions. [2024-11-21 21:15:49,462 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-21 21:15:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 40965 states and 55299 transitions. [2024-11-21 21:15:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-21 21:15:49,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:49,479 INFO L215 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-21 21:15:49,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-21 21:15:49,479 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:49,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:49,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1985892154, now seen corresponding path program 1 times [2024-11-21 21:15:49,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:49,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279499561] [2024-11-21 21:15:49,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:49,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:49,498 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-21 21:15:49,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:49,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279499561] [2024-11-21 21:15:49,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279499561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:49,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:49,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:49,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551220427] [2024-11-21 21:15:49,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:49,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:49,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:49,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:49,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:49,500 INFO L87 Difference]: Start difference. First operand 40965 states and 55299 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-21 21:15:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:50,245 INFO L93 Difference]: Finished difference Result 119817 states and 159749 transitions. [2024-11-21 21:15:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:50,246 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-21 21:15:50,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:50,321 INFO L225 Difference]: With dead ends: 119817 [2024-11-21 21:15:50,322 INFO L226 Difference]: Without dead ends: 79879 [2024-11-21 21:15:50,349 INFO L431 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-21 21:15:50,349 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 175 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-21 21:15:50,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79879 states. [2024-11-21 21:15:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79879 to 79877. [2024-11-21 21:15:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79877 states, 79876 states have (on average 1.3076643797886724) internal successors, (104451), 79876 states have internal predecessors, (104451), 0 states have call successors, (0), 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-21 21:15:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79877 states to 79877 states and 104451 transitions. [2024-11-21 21:15:51,991 INFO L78 Accepts]: Start accepts. Automaton has 79877 states and 104451 transitions. Word has length 31 [2024-11-21 21:15:51,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:51,991 INFO L471 AbstractCegarLoop]: Abstraction has 79877 states and 104451 transitions. [2024-11-21 21:15:51,991 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-21 21:15:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 79877 states and 104451 transitions. [2024-11-21 21:15:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-21 21:15:52,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:52,029 INFO L215 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-21 21:15:52,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-21 21:15:52,029 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:52,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:52,030 INFO L85 PathProgramCache]: Analyzing trace with hash -720727240, now seen corresponding path program 1 times [2024-11-21 21:15:52,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:52,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330281990] [2024-11-21 21:15:52,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:52,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:52,050 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-21 21:15:52,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:52,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330281990] [2024-11-21 21:15:52,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330281990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:52,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:52,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:52,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964146093] [2024-11-21 21:15:52,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:52,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:52,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:52,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:52,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:52,051 INFO L87 Difference]: Start difference. First operand 79877 states and 104451 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-21 21:15:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:53,287 INFO L93 Difference]: Finished difference Result 88073 states and 118789 transitions. [2024-11-21 21:15:53,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:53,288 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-21 21:15:53,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:53,380 INFO L225 Difference]: With dead ends: 88073 [2024-11-21 21:15:53,380 INFO L226 Difference]: Without dead ends: 88071 [2024-11-21 21:15:53,396 INFO L431 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-21 21:15:53,397 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 38 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 202 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-21 21:15:53,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 202 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88071 states. [2024-11-21 21:15:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88071 to 79877. [2024-11-21 21:15:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79877 states, 79876 states have (on average 1.2948445089889329) internal successors, (103427), 79876 states have internal predecessors, (103427), 0 states have call successors, (0), 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-21 21:15:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79877 states to 79877 states and 103427 transitions. [2024-11-21 21:15:54,766 INFO L78 Accepts]: Start accepts. Automaton has 79877 states and 103427 transitions. Word has length 31 [2024-11-21 21:15:54,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:54,767 INFO L471 AbstractCegarLoop]: Abstraction has 79877 states and 103427 transitions. [2024-11-21 21:15:54,767 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-21 21:15:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 79877 states and 103427 transitions. [2024-11-21 21:15:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-21 21:15:54,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:54,795 INFO L215 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-21 21:15:54,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-21 21:15:54,795 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:54,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:54,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1433330092, now seen corresponding path program 1 times [2024-11-21 21:15:54,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:54,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844068991] [2024-11-21 21:15:54,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:54,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:54,809 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-21 21:15:54,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:54,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844068991] [2024-11-21 21:15:54,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844068991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:54,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:54,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:54,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740136981] [2024-11-21 21:15:54,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:54,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:54,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:54,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:54,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:54,811 INFO L87 Difference]: Start difference. First operand 79877 states and 103427 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-21 21:15:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:56,372 INFO L93 Difference]: Finished difference Result 134153 states and 176133 transitions. [2024-11-21 21:15:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:56,372 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-21 21:15:56,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:56,495 INFO L225 Difference]: With dead ends: 134153 [2024-11-21 21:15:56,495 INFO L226 Difference]: Without dead ends: 134151 [2024-11-21 21:15:56,511 INFO L431 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-21 21:15:56,512 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 35 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 153 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-21 21:15:56,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134151 states. [2024-11-21 21:15:58,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134151 to 121861. [2024-11-21 21:15:58,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121861 states, 121860 states have (on average 1.2604874446085672) internal successors, (153603), 121860 states have internal predecessors, (153603), 0 states have call successors, (0), 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-21 21:15:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121861 states to 121861 states and 153603 transitions. [2024-11-21 21:15:58,251 INFO L78 Accepts]: Start accepts. Automaton has 121861 states and 153603 transitions. Word has length 32 [2024-11-21 21:15:58,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:58,251 INFO L471 AbstractCegarLoop]: Abstraction has 121861 states and 153603 transitions. [2024-11-21 21:15:58,251 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-21 21:15:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 121861 states and 153603 transitions. [2024-11-21 21:15:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-21 21:15:58,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:58,593 INFO L215 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-21 21:15:58,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-21 21:15:58,593 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:58,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash -155017810, now seen corresponding path program 1 times [2024-11-21 21:15:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:58,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523278085] [2024-11-21 21:15:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:58,622 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-21 21:15:58,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:58,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523278085] [2024-11-21 21:15:58,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523278085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:58,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:58,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:58,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614768213] [2024-11-21 21:15:58,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:58,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:58,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:58,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:58,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:58,624 INFO L87 Difference]: Start difference. First operand 121861 states and 153603 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-21 21:16:00,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:00,528 INFO L93 Difference]: Finished difference Result 277513 states and 350213 transitions. [2024-11-21 21:16:00,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:16:00,529 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-21 21:16:00,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:00,686 INFO L225 Difference]: With dead ends: 277513 [2024-11-21 21:16:00,687 INFO L226 Difference]: Without dead ends: 156679 [2024-11-21 21:16:00,740 INFO L431 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-21 21:16:00,740 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 57 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 210 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-21 21:16:00,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 210 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:16:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156679 states. [2024-11-21 21:16:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156679 to 156677. [2024-11-21 21:16:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156677 states, 156676 states have (on average 1.2418175087441599) internal successors, (194563), 156676 states have internal predecessors, (194563), 0 states have call successors, (0), 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-21 21:16:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156677 states to 156677 states and 194563 transitions. [2024-11-21 21:16:03,751 INFO L78 Accepts]: Start accepts. Automaton has 156677 states and 194563 transitions. Word has length 32 [2024-11-21 21:16:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:03,751 INFO L471 AbstractCegarLoop]: Abstraction has 156677 states and 194563 transitions. [2024-11-21 21:16:03,751 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-21 21:16:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 156677 states and 194563 transitions. [2024-11-21 21:16:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-21 21:16:03,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:03,819 INFO L215 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-21 21:16:03,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-21 21:16:03,819 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:03,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1483775695, now seen corresponding path program 1 times [2024-11-21 21:16:03,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:03,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424096550] [2024-11-21 21:16:03,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:03,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:03,837 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-21 21:16:03,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:03,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424096550] [2024-11-21 21:16:03,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424096550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:03,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:03,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:16:03,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32619562] [2024-11-21 21:16:03,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:03,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:16:03,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:03,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:16:03,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:16:03,839 INFO L87 Difference]: Start difference. First operand 156677 states and 194563 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-21 21:16:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:05,980 INFO L93 Difference]: Finished difference Result 236553 states and 293893 transitions. [2024-11-21 21:16:05,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:16:05,981 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-21 21:16:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:06,151 INFO L225 Difference]: With dead ends: 236553 [2024-11-21 21:16:06,151 INFO L226 Difference]: Without dead ends: 159751 [2024-11-21 21:16:06,200 INFO L431 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-21 21:16:06,200 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 59 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 180 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-21 21:16:06,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:16:06,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159751 states. [2024-11-21 21:16:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159751 to 159749. [2024-11-21 21:16:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159749 states, 159748 states have (on average 1.2307571925783107) internal successors, (196611), 159748 states have internal predecessors, (196611), 0 states have call successors, (0), 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-21 21:16:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159749 states to 159749 states and 196611 transitions. [2024-11-21 21:16:09,390 INFO L78 Accepts]: Start accepts. Automaton has 159749 states and 196611 transitions. Word has length 33 [2024-11-21 21:16:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:09,390 INFO L471 AbstractCegarLoop]: Abstraction has 159749 states and 196611 transitions. [2024-11-21 21:16:09,390 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-21 21:16:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand 159749 states and 196611 transitions. [2024-11-21 21:16:09,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-21 21:16:09,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:09,447 INFO L215 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-21 21:16:09,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-21 21:16:09,447 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:09,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:09,447 INFO L85 PathProgramCache]: Analyzing trace with hash -510369011, now seen corresponding path program 1 times [2024-11-21 21:16:09,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:16:09,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980329465] [2024-11-21 21:16:09,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:16:09,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:16:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:16:09,465 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-21 21:16:09,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:16:09,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980329465] [2024-11-21 21:16:09,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980329465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:16:09,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:16:09,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:16:09,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27302560] [2024-11-21 21:16:09,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:16:09,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:16:09,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:16:09,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:16:09,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:16:09,468 INFO L87 Difference]: Start difference. First operand 159749 states and 196611 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-21 21:16:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:12,315 INFO L93 Difference]: Finished difference Result 262153 states and 323589 transitions. [2024-11-21 21:16:12,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:16:12,316 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-21 21:16:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:12,596 INFO L225 Difference]: With dead ends: 262153 [2024-11-21 21:16:12,596 INFO L226 Difference]: Without dead ends: 262151 [2024-11-21 21:16:12,643 INFO L431 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-21 21:16:12,643 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 151 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-21 21:16:12,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:16:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262151 states.