./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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 /storage/repos/ultimate/releaseScripts/default/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-wip.dd.update-z3-fca748b-m [2024-11-19 17:15:08,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 17:15:08,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 17:15:08,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 17:15:08,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 17:15:08,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 17:15:08,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 17:15:08,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 17:15:08,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 17:15:08,422 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 17:15:08,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 17:15:08,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 17:15:08,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 17:15:08,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 17:15:08,424 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 17:15:08,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 17:15:08,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 17:15:08,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 17:15:08,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 17:15:08,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 17:15:08,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 17:15:08,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 17:15:08,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 17:15:08,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 17:15:08,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 17:15:08,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 17:15:08,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 17:15:08,432 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 17:15:08,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 17:15:08,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 17:15:08,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 17:15:08,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 17:15:08,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:15:08,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 17:15:08,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 17:15:08,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 17:15:08,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 17:15:08,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 17:15:08,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 17:15:08,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 17:15:08,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 17:15:08,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 17:15:08,436 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-19 17:15:08,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 17:15:08,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 17:15:08,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 17:15:08,752 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 17:15:08,752 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 17:15:08,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2024-11-19 17:15:10,210 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 17:15:10,403 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 17:15:10,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2024-11-19 17:15:10,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351387066/4dbd092fd26e4c6cb059890fcd7fb316/FLAG96eb60288 [2024-11-19 17:15:10,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351387066/4dbd092fd26e4c6cb059890fcd7fb316 [2024-11-19 17:15:10,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 17:15:10,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 17:15:10,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 17:15:10,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 17:15:10,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 17:15:10,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:15:10" (1/1) ... [2024-11-19 17:15:10,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d0ad777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10, skipping insertion in model container [2024-11-19 17:15:10,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:15:10" (1/1) ... [2024-11-19 17:15:10,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 17:15:10,664 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-19 17:15:10,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:15:10,682 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 17:15:10,716 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-19 17:15:10,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:15:10,730 INFO L204 MainTranslator]: Completed translation [2024-11-19 17:15:10,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10 WrapperNode [2024-11-19 17:15:10,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 17:15:10,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 17:15:10,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 17:15:10,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 17:15:10,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10" (1/1) ... [2024-11-19 17:15:10,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10" (1/1) ... [2024-11-19 17:15:10,804 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 196 [2024-11-19 17:15:10,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 17:15:10,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 17:15:10,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 17:15:10,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 17:15:10,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10" (1/1) ... [2024-11-19 17:15:10,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10" (1/1) ... [2024-11-19 17:15:10,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10" (1/1) ... [2024-11-19 17:15:10,832 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-19 17:15:10,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10" (1/1) ... [2024-11-19 17:15:10,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10" (1/1) ... [2024-11-19 17:15:10,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10" (1/1) ... [2024-11-19 17:15:10,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10" (1/1) ... [2024-11-19 17:15:10,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10" (1/1) ... [2024-11-19 17:15:10,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10" (1/1) ... [2024-11-19 17:15:10,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 17:15:10,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 17:15:10,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 17:15:10,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 17:15:10,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10" (1/1) ... [2024-11-19 17:15:10,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:15:10,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:15:10,882 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-19 17:15:10,885 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-19 17:15:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 17:15:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 17:15:10,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 17:15:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 17:15:10,975 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 17:15:10,976 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 17:15:11,208 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-19 17:15:11,212 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 17:15:11,225 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 17:15:11,226 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 17:15:11,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:15:11 BoogieIcfgContainer [2024-11-19 17:15:11,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 17:15:11,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 17:15:11,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 17:15:11,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 17:15:11,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:15:10" (1/3) ... [2024-11-19 17:15:11,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dadb036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:15:11, skipping insertion in model container [2024-11-19 17:15:11,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:10" (2/3) ... [2024-11-19 17:15:11,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dadb036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:15:11, skipping insertion in model container [2024-11-19 17:15:11,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:15:11" (3/3) ... [2024-11-19 17:15:11,235 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2024-11-19 17:15:11,251 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 17:15:11,251 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 17:15:11,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 17:15:11,303 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;@1fce950e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 17:15:11,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 17:15:11,306 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-19 17:15:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 17:15:11,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:11,313 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-19 17:15:11,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:11,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:11,318 INFO L85 PathProgramCache]: Analyzing trace with hash 792943379, now seen corresponding path program 1 times [2024-11-19 17:15:11,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:11,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270050513] [2024-11-19 17:15:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:11,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:11,553 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-19 17:15:11,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:11,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270050513] [2024-11-19 17:15:11,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270050513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:11,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:11,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:11,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376653788] [2024-11-19 17:15:11,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:11,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:11,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:11,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:11,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:11,590 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-19 17:15:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:11,642 INFO L93 Difference]: Finished difference Result 105 states and 192 transitions. [2024-11-19 17:15:11,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:11,644 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-19 17:15:11,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:11,652 INFO L225 Difference]: With dead ends: 105 [2024-11-19 17:15:11,652 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 17:15:11,655 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-19 17:15:11,658 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-19 17:15:11,662 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-19 17:15:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 17:15:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2024-11-19 17:15:11,695 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-19 17:15:11,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2024-11-19 17:15:11,699 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2024-11-19 17:15:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:11,699 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2024-11-19 17:15:11,700 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-19 17:15:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2024-11-19 17:15:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 17:15:11,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:11,701 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-19 17:15:11,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 17:15:11,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:11,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:11,702 INFO L85 PathProgramCache]: Analyzing trace with hash -795404523, now seen corresponding path program 1 times [2024-11-19 17:15:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:11,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270446724] [2024-11-19 17:15:11,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:11,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:11,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-19 17:15:11,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:11,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270446724] [2024-11-19 17:15:11,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270446724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:11,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:11,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:11,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078069258] [2024-11-19 17:15:11,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:11,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:11,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:11,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:11,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:11,823 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-19 17:15:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:11,848 INFO L93 Difference]: Finished difference Result 154 states and 289 transitions. [2024-11-19 17:15:11,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:11,848 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-19 17:15:11,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:11,849 INFO L225 Difference]: With dead ends: 154 [2024-11-19 17:15:11,849 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 17:15:11,850 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-19 17:15:11,851 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-19 17:15:11,852 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-19 17:15:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 17:15:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-11-19 17:15:11,860 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-19 17:15:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 170 transitions. [2024-11-19 17:15:11,863 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 170 transitions. Word has length 21 [2024-11-19 17:15:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:11,864 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 170 transitions. [2024-11-19 17:15:11,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:15:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 170 transitions. [2024-11-19 17:15:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 17:15:11,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:11,866 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-19 17:15:11,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 17:15:11,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:11,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:11,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1188346975, now seen corresponding path program 1 times [2024-11-19 17:15:11,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:11,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136691] [2024-11-19 17:15:11,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:11,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:11,946 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-19 17:15:11,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:11,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136691] [2024-11-19 17:15:11,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:11,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:11,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:11,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597575167] [2024-11-19 17:15:11,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:11,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:11,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:11,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:11,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:11,950 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-19 17:15:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:11,978 INFO L93 Difference]: Finished difference Result 141 states and 258 transitions. [2024-11-19 17:15:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:11,979 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-19 17:15:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:11,980 INFO L225 Difference]: With dead ends: 141 [2024-11-19 17:15:11,980 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 17:15:11,981 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-19 17:15:11,982 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-19 17:15:11,982 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-19 17:15:11,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 17:15:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2024-11-19 17:15:11,994 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-19 17:15:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2024-11-19 17:15:11,995 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 22 [2024-11-19 17:15:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:11,995 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2024-11-19 17:15:11,996 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-19 17:15:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2024-11-19 17:15:11,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 17:15:11,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:11,997 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-19 17:15:11,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 17:15:11,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1112475615, now seen corresponding path program 1 times [2024-11-19 17:15:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:11,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146738222] [2024-11-19 17:15:11,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:12,086 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-19 17:15:12,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:12,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146738222] [2024-11-19 17:15:12,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146738222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:12,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:12,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:12,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158310476] [2024-11-19 17:15:12,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:12,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:12,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:12,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:12,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:12,090 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-19 17:15:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:12,116 INFO L93 Difference]: Finished difference Result 181 states and 333 transitions. [2024-11-19 17:15:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:12,117 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-19 17:15:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:12,118 INFO L225 Difference]: With dead ends: 181 [2024-11-19 17:15:12,118 INFO L226 Difference]: Without dead ends: 179 [2024-11-19 17:15:12,119 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-19 17:15:12,120 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-19 17:15:12,121 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-19 17:15:12,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-19 17:15:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 125. [2024-11-19 17:15:12,129 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-19 17:15:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 229 transitions. [2024-11-19 17:15:12,131 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 229 transitions. Word has length 22 [2024-11-19 17:15:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:12,131 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 229 transitions. [2024-11-19 17:15:12,131 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-19 17:15:12,131 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 229 transitions. [2024-11-19 17:15:12,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 17:15:12,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:12,133 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-19 17:15:12,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 17:15:12,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:12,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash -475872287, now seen corresponding path program 1 times [2024-11-19 17:15:12,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:12,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801975719] [2024-11-19 17:15:12,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:12,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:12,182 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-19 17:15:12,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:12,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801975719] [2024-11-19 17:15:12,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801975719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:12,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:12,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:12,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545847997] [2024-11-19 17:15:12,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:12,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:12,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:12,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:12,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:12,185 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-19 17:15:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:12,208 INFO L93 Difference]: Finished difference Result 301 states and 555 transitions. [2024-11-19 17:15:12,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:12,209 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-19 17:15:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:12,211 INFO L225 Difference]: With dead ends: 301 [2024-11-19 17:15:12,211 INFO L226 Difference]: Without dead ends: 181 [2024-11-19 17:15:12,211 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-19 17:15:12,213 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-19 17:15:12,216 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-19 17:15:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-19 17:15:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2024-11-19 17:15:12,230 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-19 17:15:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 327 transitions. [2024-11-19 17:15:12,233 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 327 transitions. Word has length 22 [2024-11-19 17:15:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:12,234 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 327 transitions. [2024-11-19 17:15:12,234 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-19 17:15:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 327 transitions. [2024-11-19 17:15:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 17:15:12,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:12,235 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-19 17:15:12,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 17:15:12,236 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:12,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:12,236 INFO L85 PathProgramCache]: Analyzing trace with hash 127218090, now seen corresponding path program 1 times [2024-11-19 17:15:12,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:12,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881287033] [2024-11-19 17:15:12,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:12,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:12,298 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-19 17:15:12,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:12,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881287033] [2024-11-19 17:15:12,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881287033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:12,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:12,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:12,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531325467] [2024-11-19 17:15:12,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:12,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:12,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:12,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:12,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:12,301 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-19 17:15:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:12,320 INFO L93 Difference]: Finished difference Result 270 states and 490 transitions. [2024-11-19 17:15:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:12,322 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-19 17:15:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:12,324 INFO L225 Difference]: With dead ends: 270 [2024-11-19 17:15:12,325 INFO L226 Difference]: Without dead ends: 183 [2024-11-19 17:15:12,326 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-19 17:15:12,331 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-19 17:15:12,332 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-19 17:15:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-19 17:15:12,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2024-11-19 17:15:12,341 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-19 17:15:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 327 transitions. [2024-11-19 17:15:12,344 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 327 transitions. Word has length 23 [2024-11-19 17:15:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:12,345 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 327 transitions. [2024-11-19 17:15:12,345 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-19 17:15:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 327 transitions. [2024-11-19 17:15:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 17:15:12,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:12,350 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-19 17:15:12,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 17:15:12,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:12,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:12,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1866926616, now seen corresponding path program 1 times [2024-11-19 17:15:12,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:12,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987225224] [2024-11-19 17:15:12,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:12,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:12,397 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-19 17:15:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987225224] [2024-11-19 17:15:12,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987225224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:12,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:12,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:12,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072810177] [2024-11-19 17:15:12,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:12,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:12,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:12,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:12,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:12,401 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-19 17:15:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:12,421 INFO L93 Difference]: Finished difference Result 525 states and 953 transitions. [2024-11-19 17:15:12,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:12,421 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-19 17:15:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:12,426 INFO L225 Difference]: With dead ends: 525 [2024-11-19 17:15:12,426 INFO L226 Difference]: Without dead ends: 351 [2024-11-19 17:15:12,427 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-19 17:15:12,430 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-19 17:15:12,430 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-19 17:15:12,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-19 17:15:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2024-11-19 17:15:12,449 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-19 17:15:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 627 transitions. [2024-11-19 17:15:12,452 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 627 transitions. Word has length 23 [2024-11-19 17:15:12,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:12,453 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 627 transitions. [2024-11-19 17:15:12,453 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-19 17:15:12,453 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 627 transitions. [2024-11-19 17:15:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 17:15:12,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:12,455 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-19 17:15:12,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 17:15:12,455 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:12,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:12,456 INFO L85 PathProgramCache]: Analyzing trace with hash -278578714, now seen corresponding path program 1 times [2024-11-19 17:15:12,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:12,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319051463] [2024-11-19 17:15:12,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:12,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:12,501 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-19 17:15:12,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:12,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319051463] [2024-11-19 17:15:12,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319051463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:12,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:12,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:12,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140821033] [2024-11-19 17:15:12,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:12,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:12,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:12,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:12,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:12,504 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-19 17:15:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:12,525 INFO L93 Difference]: Finished difference Result 449 states and 813 transitions. [2024-11-19 17:15:12,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:12,526 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-19 17:15:12,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:12,528 INFO L225 Difference]: With dead ends: 449 [2024-11-19 17:15:12,528 INFO L226 Difference]: Without dead ends: 447 [2024-11-19 17:15:12,529 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-19 17:15:12,529 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-19 17:15:12,530 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-19 17:15:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-19 17:15:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 349. [2024-11-19 17:15:12,542 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-19 17:15:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 623 transitions. [2024-11-19 17:15:12,543 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 623 transitions. Word has length 23 [2024-11-19 17:15:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:12,544 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 623 transitions. [2024-11-19 17:15:12,544 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-19 17:15:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 623 transitions. [2024-11-19 17:15:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 17:15:12,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:12,546 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-19 17:15:12,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 17:15:12,546 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:12,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:12,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2039937514, now seen corresponding path program 1 times [2024-11-19 17:15:12,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:12,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968974703] [2024-11-19 17:15:12,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:12,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:12,590 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-19 17:15:12,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:12,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968974703] [2024-11-19 17:15:12,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968974703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:12,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:12,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:12,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280824728] [2024-11-19 17:15:12,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:12,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:12,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:12,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:12,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:12,594 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-19 17:15:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:12,617 INFO L93 Difference]: Finished difference Result 661 states and 1193 transitions. [2024-11-19 17:15:12,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:12,620 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-19 17:15:12,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:12,623 INFO L225 Difference]: With dead ends: 661 [2024-11-19 17:15:12,623 INFO L226 Difference]: Without dead ends: 659 [2024-11-19 17:15:12,623 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-19 17:15:12,624 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-19 17:15:12,624 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-19 17:15:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-19 17:15:12,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 481. [2024-11-19 17:15:12,641 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-19 17:15:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 847 transitions. [2024-11-19 17:15:12,642 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 847 transitions. Word has length 24 [2024-11-19 17:15:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:12,642 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 847 transitions. [2024-11-19 17:15:12,642 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-19 17:15:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 847 transitions. [2024-11-19 17:15:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 17:15:12,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:12,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] [2024-11-19 17:15:12,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 17:15:12,644 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:12,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash 666681880, now seen corresponding path program 1 times [2024-11-19 17:15:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:12,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95945469] [2024-11-19 17:15:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:12,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:12,681 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-19 17:15:12,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:12,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95945469] [2024-11-19 17:15:12,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95945469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:12,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:12,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:12,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15144383] [2024-11-19 17:15:12,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:12,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:12,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:12,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:12,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:12,683 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-19 17:15:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:12,706 INFO L93 Difference]: Finished difference Result 1157 states and 2049 transitions. [2024-11-19 17:15:12,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:12,706 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-19 17:15:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:12,709 INFO L225 Difference]: With dead ends: 1157 [2024-11-19 17:15:12,709 INFO L226 Difference]: Without dead ends: 683 [2024-11-19 17:15:12,710 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-19 17:15:12,711 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-19 17:15:12,712 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-19 17:15:12,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-19 17:15:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2024-11-19 17:15:12,746 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-19 17:15:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1195 transitions. [2024-11-19 17:15:12,748 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1195 transitions. Word has length 24 [2024-11-19 17:15:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:12,749 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1195 transitions. [2024-11-19 17:15:12,749 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-19 17:15:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1195 transitions. [2024-11-19 17:15:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 17:15:12,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:12,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, 1, 1, 1, 1] [2024-11-19 17:15:12,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 17:15:12,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:12,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:12,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1186659581, now seen corresponding path program 1 times [2024-11-19 17:15:12,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:12,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839484125] [2024-11-19 17:15:12,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:12,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:12,779 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-19 17:15:12,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:12,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839484125] [2024-11-19 17:15:12,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839484125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:12,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:12,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:12,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413301673] [2024-11-19 17:15:12,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:12,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:12,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:12,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:12,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:12,782 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-19 17:15:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:12,801 INFO L93 Difference]: Finished difference Result 1029 states and 1801 transitions. [2024-11-19 17:15:12,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:12,802 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-19 17:15:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:12,805 INFO L225 Difference]: With dead ends: 1029 [2024-11-19 17:15:12,805 INFO L226 Difference]: Without dead ends: 695 [2024-11-19 17:15:12,805 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-19 17:15:12,806 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-19 17:15:12,806 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-19 17:15:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-19 17:15:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2024-11-19 17:15:12,821 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-19 17:15:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1203 transitions. [2024-11-19 17:15:12,824 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1203 transitions. Word has length 25 [2024-11-19 17:15:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:12,824 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1203 transitions. [2024-11-19 17:15:12,824 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-19 17:15:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1203 transitions. [2024-11-19 17:15:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 17:15:12,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:12,827 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-19 17:15:12,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 17:15:12,828 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:12,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash -807485125, now seen corresponding path program 1 times [2024-11-19 17:15:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:12,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543301627] [2024-11-19 17:15:12,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:12,863 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-19 17:15:12,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:12,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543301627] [2024-11-19 17:15:12,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543301627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:12,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:12,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:12,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735646991] [2024-11-19 17:15:12,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:12,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:12,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:12,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:12,864 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-19 17:15:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:12,889 INFO L93 Difference]: Finished difference Result 1289 states and 2269 transitions. [2024-11-19 17:15:12,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:12,890 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-19 17:15:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:12,896 INFO L225 Difference]: With dead ends: 1289 [2024-11-19 17:15:12,896 INFO L226 Difference]: Without dead ends: 1287 [2024-11-19 17:15:12,896 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-19 17:15:12,897 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-19 17:15:12,897 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-19 17:15:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2024-11-19 17:15:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 965. [2024-11-19 17:15:12,921 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-19 17:15:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1643 transitions. [2024-11-19 17:15:12,926 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1643 transitions. Word has length 25 [2024-11-19 17:15:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:12,926 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1643 transitions. [2024-11-19 17:15:12,926 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-19 17:15:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1643 transitions. [2024-11-19 17:15:12,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 17:15:12,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:12,928 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-19 17:15:12,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 17:15:12,928 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:12,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:12,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1899134269, now seen corresponding path program 1 times [2024-11-19 17:15:12,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:12,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041353213] [2024-11-19 17:15:12,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:12,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:12,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-19 17:15:12,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:12,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041353213] [2024-11-19 17:15:12,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041353213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:12,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:12,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:12,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259115493] [2024-11-19 17:15:12,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:12,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:12,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:12,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:12,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:12,954 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-19 17:15:12,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:12,988 INFO L93 Difference]: Finished difference Result 2297 states and 3933 transitions. [2024-11-19 17:15:12,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:12,988 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-19 17:15:12,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:12,993 INFO L225 Difference]: With dead ends: 2297 [2024-11-19 17:15:12,993 INFO L226 Difference]: Without dead ends: 1351 [2024-11-19 17:15:12,994 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-19 17:15:12,995 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-19 17:15:12,995 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-19 17:15:12,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-11-19 17:15:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1349. [2024-11-19 17:15:13,027 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-19 17:15:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2291 transitions. [2024-11-19 17:15:13,031 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2291 transitions. Word has length 25 [2024-11-19 17:15:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:13,032 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 2291 transitions. [2024-11-19 17:15:13,032 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-19 17:15:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2291 transitions. [2024-11-19 17:15:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 17:15:13,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:13,033 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-19 17:15:13,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 17:15:13,033 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:13,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:13,034 INFO L85 PathProgramCache]: Analyzing trace with hash 737978317, now seen corresponding path program 1 times [2024-11-19 17:15:13,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:13,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124691073] [2024-11-19 17:15:13,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:13,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:13,061 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-19 17:15:13,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:13,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124691073] [2024-11-19 17:15:13,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124691073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:13,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:13,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:13,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19449221] [2024-11-19 17:15:13,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:13,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:13,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:13,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:13,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:13,062 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-19 17:15:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:13,110 INFO L93 Difference]: Finished difference Result 2025 states and 3429 transitions. [2024-11-19 17:15:13,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:13,110 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-19 17:15:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:13,116 INFO L225 Difference]: With dead ends: 2025 [2024-11-19 17:15:13,116 INFO L226 Difference]: Without dead ends: 1367 [2024-11-19 17:15:13,117 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-19 17:15:13,118 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-19 17:15:13,118 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-19 17:15:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-11-19 17:15:13,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1365. [2024-11-19 17:15:13,162 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-19 17:15:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2291 transitions. [2024-11-19 17:15:13,167 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2291 transitions. Word has length 26 [2024-11-19 17:15:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:13,167 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 2291 transitions. [2024-11-19 17:15:13,167 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-19 17:15:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2291 transitions. [2024-11-19 17:15:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 17:15:13,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:13,170 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-19 17:15:13,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 17:15:13,170 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:13,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:13,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1256166389, now seen corresponding path program 1 times [2024-11-19 17:15:13,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:13,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394980429] [2024-11-19 17:15:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:13,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:13,202 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-19 17:15:13,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:13,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394980429] [2024-11-19 17:15:13,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394980429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:13,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:13,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:13,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200573120] [2024-11-19 17:15:13,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:13,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:13,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:13,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:13,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:13,205 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-19 17:15:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:13,249 INFO L93 Difference]: Finished difference Result 2505 states and 4277 transitions. [2024-11-19 17:15:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:13,250 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-19 17:15:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:13,258 INFO L225 Difference]: With dead ends: 2505 [2024-11-19 17:15:13,259 INFO L226 Difference]: Without dead ends: 2503 [2024-11-19 17:15:13,261 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-19 17:15:13,262 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-19 17:15:13,262 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-19 17:15:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2024-11-19 17:15:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1925. [2024-11-19 17:15:13,304 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-19 17:15:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3155 transitions. [2024-11-19 17:15:13,310 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3155 transitions. Word has length 26 [2024-11-19 17:15:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:13,310 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 3155 transitions. [2024-11-19 17:15:13,311 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-19 17:15:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3155 transitions. [2024-11-19 17:15:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 17:15:13,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:13,313 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-19 17:15:13,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 17:15:13,313 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:13,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1450453005, now seen corresponding path program 1 times [2024-11-19 17:15:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:13,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908785859] [2024-11-19 17:15:13,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:13,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:13,344 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-19 17:15:13,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:13,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908785859] [2024-11-19 17:15:13,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908785859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:13,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:13,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:13,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856505500] [2024-11-19 17:15:13,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:13,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:13,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:13,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:13,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:13,347 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-19 17:15:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:13,397 INFO L93 Difference]: Finished difference Result 4553 states and 7509 transitions. [2024-11-19 17:15:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:13,398 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-19 17:15:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:13,406 INFO L225 Difference]: With dead ends: 4553 [2024-11-19 17:15:13,406 INFO L226 Difference]: Without dead ends: 2663 [2024-11-19 17:15:13,410 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-19 17:15:13,411 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-19 17:15:13,411 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-19 17:15:13,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2024-11-19 17:15:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2661. [2024-11-19 17:15:13,496 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-19 17:15:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 4355 transitions. [2024-11-19 17:15:13,504 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 4355 transitions. Word has length 26 [2024-11-19 17:15:13,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:13,504 INFO L471 AbstractCegarLoop]: Abstraction has 2661 states and 4355 transitions. [2024-11-19 17:15:13,504 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-19 17:15:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 4355 transitions. [2024-11-19 17:15:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 17:15:13,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:13,507 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-19 17:15:13,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 17:15:13,507 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:13,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:13,508 INFO L85 PathProgramCache]: Analyzing trace with hash -286238638, now seen corresponding path program 1 times [2024-11-19 17:15:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383745643] [2024-11-19 17:15:13,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:13,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:13,541 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-19 17:15:13,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:13,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383745643] [2024-11-19 17:15:13,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383745643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:13,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:13,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:13,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476126076] [2024-11-19 17:15:13,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:13,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:13,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:13,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:13,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:13,542 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-19 17:15:13,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:13,598 INFO L93 Difference]: Finished difference Result 3993 states and 6517 transitions. [2024-11-19 17:15:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:13,599 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-19 17:15:13,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:13,607 INFO L225 Difference]: With dead ends: 3993 [2024-11-19 17:15:13,607 INFO L226 Difference]: Without dead ends: 2695 [2024-11-19 17:15:13,609 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-19 17:15:13,610 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-19 17:15:13,610 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-19 17:15:13,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2024-11-19 17:15:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2693. [2024-11-19 17:15:13,678 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-19 17:15:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 4355 transitions. [2024-11-19 17:15:13,686 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 4355 transitions. Word has length 27 [2024-11-19 17:15:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:13,686 INFO L471 AbstractCegarLoop]: Abstraction has 2693 states and 4355 transitions. [2024-11-19 17:15:13,686 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-19 17:15:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 4355 transitions. [2024-11-19 17:15:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 17:15:13,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:13,689 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-19 17:15:13,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 17:15:13,689 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:13,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:13,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2014583952, now seen corresponding path program 1 times [2024-11-19 17:15:13,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:13,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003714134] [2024-11-19 17:15:13,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:13,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:13,719 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-19 17:15:13,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:13,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003714134] [2024-11-19 17:15:13,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003714134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:13,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:13,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:13,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423390123] [2024-11-19 17:15:13,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:13,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:13,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:13,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:13,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:13,721 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-19 17:15:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:13,812 INFO L93 Difference]: Finished difference Result 4873 states and 8037 transitions. [2024-11-19 17:15:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:13,812 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-19 17:15:13,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:13,828 INFO L225 Difference]: With dead ends: 4873 [2024-11-19 17:15:13,828 INFO L226 Difference]: Without dead ends: 4871 [2024-11-19 17:15:13,829 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-19 17:15:13,830 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-19 17:15:13,830 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-19 17:15:13,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2024-11-19 17:15:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 3845. [2024-11-19 17:15:13,911 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-19 17:15:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 6051 transitions. [2024-11-19 17:15:13,922 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 6051 transitions. Word has length 27 [2024-11-19 17:15:13,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:13,923 INFO L471 AbstractCegarLoop]: Abstraction has 3845 states and 6051 transitions. [2024-11-19 17:15:13,923 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-19 17:15:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 6051 transitions. [2024-11-19 17:15:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 17:15:13,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:13,927 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-19 17:15:13,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 17:15:13,928 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:13,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:13,928 INFO L85 PathProgramCache]: Analyzing trace with hash 426236050, now seen corresponding path program 1 times [2024-11-19 17:15:13,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:13,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144540138] [2024-11-19 17:15:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:13,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:15:13,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:13,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144540138] [2024-11-19 17:15:13,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144540138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:13,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:13,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462386972] [2024-11-19 17:15:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:13,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:13,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:13,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:13,950 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-19 17:15:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:14,044 INFO L93 Difference]: Finished difference Result 9033 states and 14309 transitions. [2024-11-19 17:15:14,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:14,045 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-19 17:15:14,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:14,068 INFO L225 Difference]: With dead ends: 9033 [2024-11-19 17:15:14,072 INFO L226 Difference]: Without dead ends: 5255 [2024-11-19 17:15:14,078 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-19 17:15:14,078 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-19 17:15:14,079 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-19 17:15:14,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2024-11-19 17:15:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 5253. [2024-11-19 17:15:14,218 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-19 17:15:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5253 states to 5253 states and 8259 transitions. [2024-11-19 17:15:14,234 INFO L78 Accepts]: Start accepts. Automaton has 5253 states and 8259 transitions. Word has length 27 [2024-11-19 17:15:14,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:14,234 INFO L471 AbstractCegarLoop]: Abstraction has 5253 states and 8259 transitions. [2024-11-19 17:15:14,234 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-19 17:15:14,234 INFO L276 IsEmpty]: Start isEmpty. Operand 5253 states and 8259 transitions. [2024-11-19 17:15:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 17:15:14,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:14,241 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-19 17:15:14,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 17:15:14,241 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:14,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1972192830, now seen corresponding path program 1 times [2024-11-19 17:15:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:14,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677081979] [2024-11-19 17:15:14,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:14,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:14,265 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-19 17:15:14,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:14,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677081979] [2024-11-19 17:15:14,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677081979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:14,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:14,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:14,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072811565] [2024-11-19 17:15:14,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:14,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:14,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:14,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:14,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:14,267 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-19 17:15:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:14,377 INFO L93 Difference]: Finished difference Result 7881 states and 12357 transitions. [2024-11-19 17:15:14,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:14,378 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-19 17:15:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:14,391 INFO L225 Difference]: With dead ends: 7881 [2024-11-19 17:15:14,392 INFO L226 Difference]: Without dead ends: 5319 [2024-11-19 17:15:14,395 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-19 17:15:14,397 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-19 17:15:14,397 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-19 17:15:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2024-11-19 17:15:14,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 5317. [2024-11-19 17:15:14,546 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-19 17:15:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 8259 transitions. [2024-11-19 17:15:14,565 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 8259 transitions. Word has length 28 [2024-11-19 17:15:14,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:14,565 INFO L471 AbstractCegarLoop]: Abstraction has 5317 states and 8259 transitions. [2024-11-19 17:15:14,566 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-19 17:15:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 8259 transitions. [2024-11-19 17:15:14,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 17:15:14,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:14,570 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-19 17:15:14,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 17:15:14,571 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:14,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:14,571 INFO L85 PathProgramCache]: Analyzing trace with hash 328629760, now seen corresponding path program 1 times [2024-11-19 17:15:14,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:14,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887463198] [2024-11-19 17:15:14,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:14,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:14,600 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-19 17:15:14,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:14,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887463198] [2024-11-19 17:15:14,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887463198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:14,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:14,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:14,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533731423] [2024-11-19 17:15:14,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:14,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:14,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:14,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:14,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:14,603 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-19 17:15:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:14,761 INFO L93 Difference]: Finished difference Result 9481 states and 15045 transitions. [2024-11-19 17:15:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:14,762 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-19 17:15:14,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:14,776 INFO L225 Difference]: With dead ends: 9481 [2024-11-19 17:15:14,776 INFO L226 Difference]: Without dead ends: 9479 [2024-11-19 17:15:14,778 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-19 17:15:14,778 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-19 17:15:14,779 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-19 17:15:14,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9479 states. [2024-11-19 17:15:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9479 to 7685. [2024-11-19 17:15:14,932 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-19 17:15:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7685 states to 7685 states and 11587 transitions. [2024-11-19 17:15:14,951 INFO L78 Accepts]: Start accepts. Automaton has 7685 states and 11587 transitions. Word has length 28 [2024-11-19 17:15:14,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:14,951 INFO L471 AbstractCegarLoop]: Abstraction has 7685 states and 11587 transitions. [2024-11-19 17:15:14,952 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-19 17:15:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 7685 states and 11587 transitions. [2024-11-19 17:15:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 17:15:14,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:14,960 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-19 17:15:14,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 17:15:14,960 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:14,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1259718142, now seen corresponding path program 1 times [2024-11-19 17:15:14,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:14,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185262703] [2024-11-19 17:15:14,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:14,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:14,981 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-19 17:15:14,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:14,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185262703] [2024-11-19 17:15:14,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185262703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:14,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:14,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:14,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506909279] [2024-11-19 17:15:14,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:14,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:14,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:14,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:14,983 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-19 17:15:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:15,166 INFO L93 Difference]: Finished difference Result 17929 states and 27205 transitions. [2024-11-19 17:15:15,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:15,166 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-19 17:15:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:15,184 INFO L225 Difference]: With dead ends: 17929 [2024-11-19 17:15:15,184 INFO L226 Difference]: Without dead ends: 10375 [2024-11-19 17:15:15,193 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-19 17:15:15,194 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-19 17:15:15,195 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-19 17:15:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10375 states. [2024-11-19 17:15:15,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10375 to 10373. [2024-11-19 17:15:15,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-19 17:15:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10373 states to 10373 states and 15619 transitions. [2024-11-19 17:15:15,502 INFO L78 Accepts]: Start accepts. Automaton has 10373 states and 15619 transitions. Word has length 28 [2024-11-19 17:15:15,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:15,503 INFO L471 AbstractCegarLoop]: Abstraction has 10373 states and 15619 transitions. [2024-11-19 17:15:15,503 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-19 17:15:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 10373 states and 15619 transitions. [2024-11-19 17:15:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 17:15:15,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:15,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, 1, 1, 1, 1] [2024-11-19 17:15:15,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 17:15:15,512 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:15,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:15,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1597802407, now seen corresponding path program 1 times [2024-11-19 17:15:15,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:15,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466381604] [2024-11-19 17:15:15,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:15,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:15,540 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-19 17:15:15,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:15,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466381604] [2024-11-19 17:15:15,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466381604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:15,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:15,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:15,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376422379] [2024-11-19 17:15:15,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:15,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:15,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:15,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:15,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:15,542 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-19 17:15:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:15,792 INFO L93 Difference]: Finished difference Result 15561 states and 23365 transitions. [2024-11-19 17:15:15,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:15,793 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-19 17:15:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:15,812 INFO L225 Difference]: With dead ends: 15561 [2024-11-19 17:15:15,813 INFO L226 Difference]: Without dead ends: 10503 [2024-11-19 17:15:15,820 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-19 17:15:15,821 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-19 17:15:15,821 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-19 17:15:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10503 states. [2024-11-19 17:15:16,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10503 to 10501. [2024-11-19 17:15:16,163 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-19 17:15:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10501 states to 10501 states and 15619 transitions. [2024-11-19 17:15:16,185 INFO L78 Accepts]: Start accepts. Automaton has 10501 states and 15619 transitions. Word has length 29 [2024-11-19 17:15:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:16,186 INFO L471 AbstractCegarLoop]: Abstraction has 10501 states and 15619 transitions. [2024-11-19 17:15:16,186 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-19 17:15:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 10501 states and 15619 transitions. [2024-11-19 17:15:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 17:15:16,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:16,195 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-19 17:15:16,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 17:15:16,195 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:16,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash -396342299, now seen corresponding path program 1 times [2024-11-19 17:15:16,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:16,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808471136] [2024-11-19 17:15:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:16,223 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-19 17:15:16,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:16,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808471136] [2024-11-19 17:15:16,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808471136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:16,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:16,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:16,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656987344] [2024-11-19 17:15:16,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:16,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:16,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:16,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:16,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:16,225 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-19 17:15:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:16,403 INFO L93 Difference]: Finished difference Result 18441 states and 28037 transitions. [2024-11-19 17:15:16,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:16,404 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-19 17:15:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:16,436 INFO L225 Difference]: With dead ends: 18441 [2024-11-19 17:15:16,436 INFO L226 Difference]: Without dead ends: 18439 [2024-11-19 17:15:16,444 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-19 17:15:16,445 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-19 17:15:16,446 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-19 17:15:16,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18439 states. [2024-11-19 17:15:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18439 to 15365. [2024-11-19 17:15:16,748 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-19 17:15:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15365 states to 15365 states and 22147 transitions. [2024-11-19 17:15:16,773 INFO L78 Accepts]: Start accepts. Automaton has 15365 states and 22147 transitions. Word has length 29 [2024-11-19 17:15:16,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:16,773 INFO L471 AbstractCegarLoop]: Abstraction has 15365 states and 22147 transitions. [2024-11-19 17:15:16,774 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-19 17:15:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 15365 states and 22147 transitions. [2024-11-19 17:15:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 17:15:16,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:16,789 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-19 17:15:16,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 17:15:16,789 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:16,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:16,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1984690201, now seen corresponding path program 1 times [2024-11-19 17:15:16,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:16,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352182326] [2024-11-19 17:15:16,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:16,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:16,813 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-19 17:15:16,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:16,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352182326] [2024-11-19 17:15:16,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352182326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:16,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:16,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:16,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852266386] [2024-11-19 17:15:16,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:16,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:16,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:16,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:16,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:16,815 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-19 17:15:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:17,085 INFO L93 Difference]: Finished difference Result 35593 states and 51589 transitions. [2024-11-19 17:15:17,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:17,085 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-19 17:15:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:17,120 INFO L225 Difference]: With dead ends: 35593 [2024-11-19 17:15:17,120 INFO L226 Difference]: Without dead ends: 20487 [2024-11-19 17:15:17,136 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-19 17:15:17,141 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-19 17:15:17,141 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-19 17:15:17,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20487 states. [2024-11-19 17:15:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20487 to 20485. [2024-11-19 17:15:17,701 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-19 17:15:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20485 states to 20485 states and 29443 transitions. [2024-11-19 17:15:17,741 INFO L78 Accepts]: Start accepts. Automaton has 20485 states and 29443 transitions. Word has length 29 [2024-11-19 17:15:17,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:17,741 INFO L471 AbstractCegarLoop]: Abstraction has 20485 states and 29443 transitions. [2024-11-19 17:15:17,741 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-19 17:15:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 20485 states and 29443 transitions. [2024-11-19 17:15:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 17:15:17,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:17,762 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-19 17:15:17,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 17:15:17,765 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:17,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:17,765 INFO L85 PathProgramCache]: Analyzing trace with hash 598505399, now seen corresponding path program 1 times [2024-11-19 17:15:17,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:17,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497162407] [2024-11-19 17:15:17,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:17,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:17,799 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-19 17:15:17,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:17,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497162407] [2024-11-19 17:15:17,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497162407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:17,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:17,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:17,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908069514] [2024-11-19 17:15:17,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:17,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:17,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:17,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:17,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:17,801 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-19 17:15:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:18,145 INFO L93 Difference]: Finished difference Result 30729 states and 44037 transitions. [2024-11-19 17:15:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:18,145 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-19 17:15:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:18,184 INFO L225 Difference]: With dead ends: 30729 [2024-11-19 17:15:18,184 INFO L226 Difference]: Without dead ends: 20743 [2024-11-19 17:15:18,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-19 17:15:18,197 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-19 17:15:18,199 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-19 17:15:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20743 states. [2024-11-19 17:15:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20743 to 20741. [2024-11-19 17:15:18,662 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-19 17:15:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20741 states to 20741 states and 29443 transitions. [2024-11-19 17:15:18,694 INFO L78 Accepts]: Start accepts. Automaton has 20741 states and 29443 transitions. Word has length 30 [2024-11-19 17:15:18,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:18,694 INFO L471 AbstractCegarLoop]: Abstraction has 20741 states and 29443 transitions. [2024-11-19 17:15:18,694 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-19 17:15:18,695 INFO L276 IsEmpty]: Start isEmpty. Operand 20741 states and 29443 transitions. [2024-11-19 17:15:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 17:15:18,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:18,708 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-19 17:15:18,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 17:15:18,708 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:18,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1395639307, now seen corresponding path program 1 times [2024-11-19 17:15:18,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:18,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194451950] [2024-11-19 17:15:18,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:18,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:18,735 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-19 17:15:18,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:18,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194451950] [2024-11-19 17:15:18,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194451950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:18,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:18,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:18,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857620038] [2024-11-19 17:15:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:18,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:18,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:18,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:18,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:18,737 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-19 17:15:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:19,134 INFO L93 Difference]: Finished difference Result 35849 states and 51973 transitions. [2024-11-19 17:15:19,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:19,135 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-19 17:15:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:19,186 INFO L225 Difference]: With dead ends: 35849 [2024-11-19 17:15:19,187 INFO L226 Difference]: Without dead ends: 35847 [2024-11-19 17:15:19,193 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-19 17:15:19,193 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-19 17:15:19,195 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-19 17:15:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35847 states. [2024-11-19 17:15:19,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35847 to 30725. [2024-11-19 17:15:19,611 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-19 17:15:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30725 states to 30725 states and 42243 transitions. [2024-11-19 17:15:19,829 INFO L78 Accepts]: Start accepts. Automaton has 30725 states and 42243 transitions. Word has length 30 [2024-11-19 17:15:19,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:19,829 INFO L471 AbstractCegarLoop]: Abstraction has 30725 states and 42243 transitions. [2024-11-19 17:15:19,829 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-19 17:15:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand 30725 states and 42243 transitions. [2024-11-19 17:15:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 17:15:19,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:19,861 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-19 17:15:19,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 17:15:19,861 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:19,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:19,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1310980087, now seen corresponding path program 1 times [2024-11-19 17:15:19,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:19,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073452366] [2024-11-19 17:15:19,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:19,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:19,895 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-19 17:15:19,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:19,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073452366] [2024-11-19 17:15:19,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073452366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:19,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:19,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:19,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417728135] [2024-11-19 17:15:19,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:19,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:19,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:19,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:19,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:19,898 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-19 17:15:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:20,448 INFO L93 Difference]: Finished difference Result 70665 states and 97541 transitions. [2024-11-19 17:15:20,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:20,449 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-19 17:15:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:20,647 INFO L225 Difference]: With dead ends: 70665 [2024-11-19 17:15:20,647 INFO L226 Difference]: Without dead ends: 40455 [2024-11-19 17:15:20,669 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-19 17:15:20,670 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-19 17:15:20,670 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-19 17:15:20,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40455 states. [2024-11-19 17:15:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40455 to 40453. [2024-11-19 17:15:21,291 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-19 17:15:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40453 states to 40453 states and 55299 transitions. [2024-11-19 17:15:21,334 INFO L78 Accepts]: Start accepts. Automaton has 40453 states and 55299 transitions. Word has length 30 [2024-11-19 17:15:21,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:21,334 INFO L471 AbstractCegarLoop]: Abstraction has 40453 states and 55299 transitions. [2024-11-19 17:15:21,334 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-19 17:15:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 40453 states and 55299 transitions. [2024-11-19 17:15:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 17:15:21,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:21,347 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-19 17:15:21,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 17:15:21,348 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:21,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:21,348 INFO L85 PathProgramCache]: Analyzing trace with hash -314930436, now seen corresponding path program 1 times [2024-11-19 17:15:21,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:21,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633717316] [2024-11-19 17:15:21,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:21,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:21,370 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-19 17:15:21,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:21,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633717316] [2024-11-19 17:15:21,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633717316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:21,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:21,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:21,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558604530] [2024-11-19 17:15:21,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:21,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:21,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:21,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:21,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:21,372 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-19 17:15:21,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:21,797 INFO L93 Difference]: Finished difference Result 60681 states and 82693 transitions. [2024-11-19 17:15:21,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:21,797 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-19 17:15:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:21,844 INFO L225 Difference]: With dead ends: 60681 [2024-11-19 17:15:21,845 INFO L226 Difference]: Without dead ends: 40967 [2024-11-19 17:15:21,860 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-19 17:15:21,861 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-19 17:15:21,861 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-19 17:15:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40967 states. [2024-11-19 17:15:22,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40967 to 40965. [2024-11-19 17:15:22,703 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-19 17:15:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40965 states to 40965 states and 55299 transitions. [2024-11-19 17:15:22,771 INFO L78 Accepts]: Start accepts. Automaton has 40965 states and 55299 transitions. Word has length 31 [2024-11-19 17:15:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:22,772 INFO L471 AbstractCegarLoop]: Abstraction has 40965 states and 55299 transitions. [2024-11-19 17:15:22,772 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-19 17:15:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 40965 states and 55299 transitions. [2024-11-19 17:15:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 17:15:22,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:22,799 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-19 17:15:22,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 17:15:22,799 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:22,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:22,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1985892154, now seen corresponding path program 1 times [2024-11-19 17:15:22,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:22,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100891479] [2024-11-19 17:15:22,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:22,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:22,822 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-19 17:15:22,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:22,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100891479] [2024-11-19 17:15:22,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100891479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:22,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:22,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:22,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867279994] [2024-11-19 17:15:22,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:22,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:22,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:22,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:22,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:22,824 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-19 17:15:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:23,718 INFO L93 Difference]: Finished difference Result 119817 states and 159749 transitions. [2024-11-19 17:15:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:23,719 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-19 17:15:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:23,889 INFO L225 Difference]: With dead ends: 119817 [2024-11-19 17:15:23,889 INFO L226 Difference]: Without dead ends: 79879 [2024-11-19 17:15:23,914 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-19 17:15:23,915 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-19 17:15:23,915 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-19 17:15:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79879 states. [2024-11-19 17:15:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79879 to 79877. [2024-11-19 17:15:25,370 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-19 17:15:25,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79877 states to 79877 states and 104451 transitions. [2024-11-19 17:15:25,672 INFO L78 Accepts]: Start accepts. Automaton has 79877 states and 104451 transitions. Word has length 31 [2024-11-19 17:15:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:25,673 INFO L471 AbstractCegarLoop]: Abstraction has 79877 states and 104451 transitions. [2024-11-19 17:15:25,673 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-19 17:15:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 79877 states and 104451 transitions. [2024-11-19 17:15:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 17:15:25,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:25,717 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-19 17:15:25,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 17:15:25,718 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:25,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:25,718 INFO L85 PathProgramCache]: Analyzing trace with hash -720727240, now seen corresponding path program 1 times [2024-11-19 17:15:25,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:25,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122819991] [2024-11-19 17:15:25,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:25,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:25,738 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-19 17:15:25,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:25,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122819991] [2024-11-19 17:15:25,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122819991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:25,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:25,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:25,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832416862] [2024-11-19 17:15:25,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:25,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:25,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:25,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:25,740 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-19 17:15:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:26,798 INFO L93 Difference]: Finished difference Result 88073 states and 118789 transitions. [2024-11-19 17:15:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:26,799 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-19 17:15:26,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:26,889 INFO L225 Difference]: With dead ends: 88073 [2024-11-19 17:15:26,889 INFO L226 Difference]: Without dead ends: 88071 [2024-11-19 17:15:26,906 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-19 17:15:26,906 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-19 17:15:26,906 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-19 17:15:26,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88071 states. [2024-11-19 17:15:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88071 to 79877. [2024-11-19 17:15:28,210 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-19 17:15:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79877 states to 79877 states and 103427 transitions. [2024-11-19 17:15:28,308 INFO L78 Accepts]: Start accepts. Automaton has 79877 states and 103427 transitions. Word has length 31 [2024-11-19 17:15:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:28,309 INFO L471 AbstractCegarLoop]: Abstraction has 79877 states and 103427 transitions. [2024-11-19 17:15:28,309 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-19 17:15:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 79877 states and 103427 transitions. [2024-11-19 17:15:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 17:15:28,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:28,543 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-19 17:15:28,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 17:15:28,544 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:28,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:28,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1433330092, now seen corresponding path program 1 times [2024-11-19 17:15:28,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:28,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478522007] [2024-11-19 17:15:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:28,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:28,589 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-19 17:15:28,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:28,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478522007] [2024-11-19 17:15:28,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478522007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:28,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:28,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:28,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823984082] [2024-11-19 17:15:28,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:28,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:28,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:28,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:28,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:28,591 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-19 17:15:30,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:30,255 INFO L93 Difference]: Finished difference Result 134153 states and 176133 transitions. [2024-11-19 17:15:30,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:30,256 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-19 17:15:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:30,396 INFO L225 Difference]: With dead ends: 134153 [2024-11-19 17:15:30,396 INFO L226 Difference]: Without dead ends: 134151 [2024-11-19 17:15:30,413 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-19 17:15:30,414 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-19 17:15:30,414 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-19 17:15:30,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134151 states. [2024-11-19 17:15:32,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134151 to 121861. [2024-11-19 17:15:32,243 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-19 17:15:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121861 states to 121861 states and 153603 transitions. [2024-11-19 17:15:32,473 INFO L78 Accepts]: Start accepts. Automaton has 121861 states and 153603 transitions. Word has length 32 [2024-11-19 17:15:32,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:32,474 INFO L471 AbstractCegarLoop]: Abstraction has 121861 states and 153603 transitions. [2024-11-19 17:15:32,474 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-19 17:15:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 121861 states and 153603 transitions. [2024-11-19 17:15:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 17:15:32,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:32,558 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-19 17:15:32,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 17:15:32,559 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:32,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:32,559 INFO L85 PathProgramCache]: Analyzing trace with hash -155017810, now seen corresponding path program 1 times [2024-11-19 17:15:32,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:32,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146906970] [2024-11-19 17:15:32,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:32,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:32,582 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-19 17:15:32,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:32,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146906970] [2024-11-19 17:15:32,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146906970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:32,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:32,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:32,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504654209] [2024-11-19 17:15:32,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:32,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:32,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:32,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:32,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:32,585 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-19 17:15:34,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:34,744 INFO L93 Difference]: Finished difference Result 277513 states and 350213 transitions. [2024-11-19 17:15:34,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:34,745 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-19 17:15:34,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:34,933 INFO L225 Difference]: With dead ends: 277513 [2024-11-19 17:15:34,933 INFO L226 Difference]: Without dead ends: 156679 [2024-11-19 17:15:35,004 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-19 17:15:35,005 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-19 17:15:35,005 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-19 17:15:35,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156679 states. [2024-11-19 17:15:38,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156679 to 156677. [2024-11-19 17:15:38,340 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-19 17:15:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156677 states to 156677 states and 194563 transitions. [2024-11-19 17:15:38,613 INFO L78 Accepts]: Start accepts. Automaton has 156677 states and 194563 transitions. Word has length 32 [2024-11-19 17:15:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:38,613 INFO L471 AbstractCegarLoop]: Abstraction has 156677 states and 194563 transitions. [2024-11-19 17:15:38,614 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-19 17:15:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 156677 states and 194563 transitions. [2024-11-19 17:15:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 17:15:38,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:38,713 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-19 17:15:38,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 17:15:38,714 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:38,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:38,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1483775695, now seen corresponding path program 1 times [2024-11-19 17:15:38,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:38,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737414449] [2024-11-19 17:15:38,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:38,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:38,732 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-19 17:15:38,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:38,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737414449] [2024-11-19 17:15:38,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737414449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:38,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:38,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:38,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264833904] [2024-11-19 17:15:38,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:38,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:38,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:38,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:38,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:38,734 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-19 17:15:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:40,946 INFO L93 Difference]: Finished difference Result 236553 states and 293893 transitions. [2024-11-19 17:15:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:40,946 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-19 17:15:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:41,109 INFO L225 Difference]: With dead ends: 236553 [2024-11-19 17:15:41,109 INFO L226 Difference]: Without dead ends: 159751 [2024-11-19 17:15:41,173 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-19 17:15:41,173 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-19 17:15:41,173 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-19 17:15:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159751 states. [2024-11-19 17:15:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159751 to 159749. [2024-11-19 17:15:44,162 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-19 17:15:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159749 states to 159749 states and 196611 transitions. [2024-11-19 17:15:44,423 INFO L78 Accepts]: Start accepts. Automaton has 159749 states and 196611 transitions. Word has length 33 [2024-11-19 17:15:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:44,423 INFO L471 AbstractCegarLoop]: Abstraction has 159749 states and 196611 transitions. [2024-11-19 17:15:44,423 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-19 17:15:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 159749 states and 196611 transitions. [2024-11-19 17:15:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 17:15:44,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:44,502 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-19 17:15:44,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 17:15:44,503 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:44,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash -510369011, now seen corresponding path program 1 times [2024-11-19 17:15:44,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:15:44,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160181875] [2024-11-19 17:15:44,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:44,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:15:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:44,528 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-19 17:15:44,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:15:44,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160181875] [2024-11-19 17:15:44,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160181875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:44,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:44,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 17:15:44,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597028012] [2024-11-19 17:15:44,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:44,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:15:44,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:15:44,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:15:44,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:15:44,530 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-19 17:15:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:47,484 INFO L93 Difference]: Finished difference Result 262153 states and 323589 transitions. [2024-11-19 17:15:47,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:15:47,485 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-19 17:15:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:47,760 INFO L225 Difference]: With dead ends: 262153 [2024-11-19 17:15:47,760 INFO L226 Difference]: Without dead ends: 262151 [2024-11-19 17:15:47,958 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-19 17:15:47,959 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-19 17:15:47,959 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-19 17:15:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262151 states.