./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_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_15-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:40:46,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:40:46,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:40:46,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:40:46,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:40:46,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:40:46,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:40:46,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:40:46,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:40:46,501 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:40:46,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:40:46,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:40:46,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:40:46,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:40:46,503 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:40:46,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:40:46,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:40:46,505 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:40:46,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:40:46,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:40:46,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:40:46,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:40:46,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:40:46,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:40:46,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:40:46,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:40:46,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:40:46,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:40:46,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:40:46,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:40:46,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:40:46,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:40:46,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:40:46,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:40:46,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:40:46,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:40:46,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:40:46,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:40:46,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:40:46,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:40:46,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:40:46,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:40:46,516 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2024-10-13 22:40:46,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:40:46,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:40:46,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:40:46,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:40:46,778 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:40:46,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2024-10-13 22:40:48,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:40:48,420 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:40:48,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2024-10-13 22:40:48,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b77cfe0/0891c1a51ea7420ab86f64f7e92643b5/FLAG5bfa0ee5c [2024-10-13 22:40:48,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b77cfe0/0891c1a51ea7420ab86f64f7e92643b5 [2024-10-13 22:40:48,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:40:48,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:40:48,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:40:48,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:40:48,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:40:48,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:40:48" (1/1) ... [2024-10-13 22:40:48,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f0b541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48, skipping insertion in model container [2024-10-13 22:40:48,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:40:48" (1/1) ... [2024-10-13 22:40:48,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:40:48,661 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2024-10-13 22:40:48,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:40:48,680 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:40:48,719 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2024-10-13 22:40:48,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:40:48,736 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:40:48,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48 WrapperNode [2024-10-13 22:40:48,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:40:48,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:40:48,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:40:48,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:40:48,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48" (1/1) ... [2024-10-13 22:40:48,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48" (1/1) ... [2024-10-13 22:40:48,772 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 208 [2024-10-13 22:40:48,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:40:48,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:40:48,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:40:48,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:40:48,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48" (1/1) ... [2024-10-13 22:40:48,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48" (1/1) ... [2024-10-13 22:40:48,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48" (1/1) ... [2024-10-13 22:40:48,809 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-10-13 22:40:48,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48" (1/1) ... [2024-10-13 22:40:48,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48" (1/1) ... [2024-10-13 22:40:48,816 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48" (1/1) ... [2024-10-13 22:40:48,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48" (1/1) ... [2024-10-13 22:40:48,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48" (1/1) ... [2024-10-13 22:40:48,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48" (1/1) ... [2024-10-13 22:40:48,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:40:48,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:40:48,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:40:48,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:40:48,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48" (1/1) ... [2024-10-13 22:40:48,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:40:48,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:40:48,865 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-10-13 22:40:48,868 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-10-13 22:40:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:40:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:40:48,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:40:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:40:48,993 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:40:48,996 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:40:49,338 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-13 22:40:49,339 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:40:49,376 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:40:49,380 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 22:40:49,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:40:49 BoogieIcfgContainer [2024-10-13 22:40:49,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:40:49,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:40:49,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:40:49,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:40:49,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:40:48" (1/3) ... [2024-10-13 22:40:49,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbff32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:40:49, skipping insertion in model container [2024-10-13 22:40:49,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:48" (2/3) ... [2024-10-13 22:40:49,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbff32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:40:49, skipping insertion in model container [2024-10-13 22:40:49,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:40:49" (3/3) ... [2024-10-13 22:40:49,394 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2024-10-13 22:40:49,412 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:40:49,412 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:40:49,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:40:49,490 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;@73463e24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:40:49,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:40:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 52 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 22:40:49,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:49,504 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-10-13 22:40:49,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:49,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash -916349520, now seen corresponding path program 1 times [2024-10-13 22:40:49,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:49,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291353072] [2024-10-13 22:40:49,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:49,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:49,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:49,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291353072] [2024-10-13 22:40:49,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291353072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:49,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:49,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:49,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016540635] [2024-10-13 22:40:49,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:49,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:49,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:49,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:49,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:49,863 INFO L87 Difference]: Start difference. First operand has 53 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 52 states have internal predecessors, (100), 0 states have call successors, (0), 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-10-13 22:40:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:49,913 INFO L93 Difference]: Finished difference Result 108 states and 201 transitions. [2024-10-13 22:40:49,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:49,917 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-10-13 22:40:49,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:49,928 INFO L225 Difference]: With dead ends: 108 [2024-10-13 22:40:49,928 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 22:40:49,930 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-10-13 22:40:49,935 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 75 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:49,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 190 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 22:40:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2024-10-13 22:40:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.9230769230769231) internal successors, (125), 65 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 125 transitions. [2024-10-13 22:40:49,973 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 125 transitions. Word has length 21 [2024-10-13 22:40:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:49,974 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 125 transitions. [2024-10-13 22:40:49,974 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-10-13 22:40:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 125 transitions. [2024-10-13 22:40:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 22:40:49,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:49,975 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-10-13 22:40:49,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:40:49,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:49,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:49,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1384473070, now seen corresponding path program 1 times [2024-10-13 22:40:49,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:49,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669022801] [2024-10-13 22:40:49,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:49,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:50,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:50,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669022801] [2024-10-13 22:40:50,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669022801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:50,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:50,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397927985] [2024-10-13 22:40:50,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:50,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:50,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:50,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:50,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:50,108 INFO L87 Difference]: Start difference. First operand 66 states and 125 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-10-13 22:40:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:50,140 INFO L93 Difference]: Finished difference Result 163 states and 308 transitions. [2024-10-13 22:40:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:50,143 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-10-13 22:40:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:50,144 INFO L225 Difference]: With dead ends: 163 [2024-10-13 22:40:50,144 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 22:40:50,145 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-10-13 22:40:50,148 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 73 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:50,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 210 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 22:40:50,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2024-10-13 22:40:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.9052631578947368) internal successors, (181), 95 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 181 transitions. [2024-10-13 22:40:50,167 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 181 transitions. Word has length 21 [2024-10-13 22:40:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:50,167 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 181 transitions. [2024-10-13 22:40:50,167 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-10-13 22:40:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 181 transitions. [2024-10-13 22:40:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 22:40:50,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:50,169 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-10-13 22:40:50,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:40:50,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:50,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1658147680, now seen corresponding path program 1 times [2024-10-13 22:40:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:50,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716628952] [2024-10-13 22:40:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:50,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:50,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716628952] [2024-10-13 22:40:50,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716628952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:50,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:50,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:50,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197383239] [2024-10-13 22:40:50,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:50,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:50,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:50,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:50,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:50,255 INFO L87 Difference]: Start difference. First operand 96 states and 181 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-10-13 22:40:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:50,277 INFO L93 Difference]: Finished difference Result 149 states and 275 transitions. [2024-10-13 22:40:50,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:50,278 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-10-13 22:40:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:50,279 INFO L225 Difference]: With dead ends: 149 [2024-10-13 22:40:50,279 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 22:40:50,279 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-10-13 22:40:50,281 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 75 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:50,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 237 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 22:40:50,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-10-13 22:40:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.8673469387755102) internal successors, (183), 98 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 183 transitions. [2024-10-13 22:40:50,300 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 183 transitions. Word has length 22 [2024-10-13 22:40:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:50,300 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 183 transitions. [2024-10-13 22:40:50,301 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-10-13 22:40:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 183 transitions. [2024-10-13 22:40:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 22:40:50,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:50,302 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-10-13 22:40:50,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 22:40:50,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:50,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:50,303 INFO L85 PathProgramCache]: Analyzing trace with hash -30796062, now seen corresponding path program 1 times [2024-10-13 22:40:50,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:50,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68529080] [2024-10-13 22:40:50,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:50,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:50,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:50,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68529080] [2024-10-13 22:40:50,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68529080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:50,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:50,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:50,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869530557] [2024-10-13 22:40:50,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:50,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:50,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:50,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:50,393 INFO L87 Difference]: Start difference. First operand 99 states and 183 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-10-13 22:40:50,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:50,425 INFO L93 Difference]: Finished difference Result 192 states and 356 transitions. [2024-10-13 22:40:50,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:50,426 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-10-13 22:40:50,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:50,427 INFO L225 Difference]: With dead ends: 192 [2024-10-13 22:40:50,428 INFO L226 Difference]: Without dead ends: 190 [2024-10-13 22:40:50,428 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-10-13 22:40:50,431 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 70 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:50,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 182 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:50,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-13 22:40:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 132. [2024-10-13 22:40:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.8625954198473282) internal successors, (244), 131 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 244 transitions. [2024-10-13 22:40:50,449 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 244 transitions. Word has length 22 [2024-10-13 22:40:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:50,450 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 244 transitions. [2024-10-13 22:40:50,450 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-10-13 22:40:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 244 transitions. [2024-10-13 22:40:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 22:40:50,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:50,451 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-10-13 22:40:50,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 22:40:50,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:50,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:50,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2024940768, now seen corresponding path program 1 times [2024-10-13 22:40:50,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:50,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354767586] [2024-10-13 22:40:50,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:50,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:50,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:50,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354767586] [2024-10-13 22:40:50,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354767586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:50,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:50,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:50,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227443237] [2024-10-13 22:40:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:50,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:50,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:50,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:50,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:50,515 INFO L87 Difference]: Start difference. First operand 132 states and 244 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-10-13 22:40:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:50,539 INFO L93 Difference]: Finished difference Result 320 states and 594 transitions. [2024-10-13 22:40:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:50,539 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-10-13 22:40:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:50,541 INFO L225 Difference]: With dead ends: 320 [2024-10-13 22:40:50,541 INFO L226 Difference]: Without dead ends: 192 [2024-10-13 22:40:50,542 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-10-13 22:40:50,543 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 72 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:50,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-13 22:40:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2024-10-13 22:40:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.8518518518518519) internal successors, (350), 189 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 350 transitions. [2024-10-13 22:40:50,553 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 350 transitions. Word has length 22 [2024-10-13 22:40:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:50,554 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 350 transitions. [2024-10-13 22:40:50,554 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-10-13 22:40:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 350 transitions. [2024-10-13 22:40:50,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 22:40:50,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:50,555 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-10-13 22:40:50,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 22:40:50,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:50,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:50,557 INFO L85 PathProgramCache]: Analyzing trace with hash -954465853, now seen corresponding path program 1 times [2024-10-13 22:40:50,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:50,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381067434] [2024-10-13 22:40:50,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:50,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:50,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:50,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381067434] [2024-10-13 22:40:50,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381067434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:50,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:50,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:50,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306443537] [2024-10-13 22:40:50,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:50,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:50,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:50,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:50,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:50,622 INFO L87 Difference]: Start difference. First operand 190 states and 350 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-10-13 22:40:50,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:50,645 INFO L93 Difference]: Finished difference Result 287 states and 525 transitions. [2024-10-13 22:40:50,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:50,646 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-10-13 22:40:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:50,648 INFO L225 Difference]: With dead ends: 287 [2024-10-13 22:40:50,649 INFO L226 Difference]: Without dead ends: 194 [2024-10-13 22:40:50,650 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-10-13 22:40:50,652 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 74 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:50,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 233 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-13 22:40:50,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2024-10-13 22:40:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.8324607329842932) internal successors, (350), 191 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 350 transitions. [2024-10-13 22:40:50,672 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 350 transitions. Word has length 23 [2024-10-13 22:40:50,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:50,673 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 350 transitions. [2024-10-13 22:40:50,673 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-10-13 22:40:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 350 transitions. [2024-10-13 22:40:50,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 22:40:50,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:50,674 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-10-13 22:40:50,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 22:40:50,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:50,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:50,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1651557701, now seen corresponding path program 1 times [2024-10-13 22:40:50,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:50,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470731882] [2024-10-13 22:40:50,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:50,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:50,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:50,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470731882] [2024-10-13 22:40:50,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470731882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:50,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:50,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:50,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278209997] [2024-10-13 22:40:50,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:50,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:50,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:50,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:50,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:50,729 INFO L87 Difference]: Start difference. First operand 192 states and 350 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-10-13 22:40:50,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:50,751 INFO L93 Difference]: Finished difference Result 560 states and 1024 transitions. [2024-10-13 22:40:50,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:50,752 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-10-13 22:40:50,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:50,755 INFO L225 Difference]: With dead ends: 560 [2024-10-13 22:40:50,755 INFO L226 Difference]: Without dead ends: 374 [2024-10-13 22:40:50,758 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-10-13 22:40:50,759 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 72 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:50,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 184 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-13 22:40:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 372. [2024-10-13 22:40:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.8167115902964959) internal successors, (674), 371 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 674 transitions. [2024-10-13 22:40:50,796 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 674 transitions. Word has length 23 [2024-10-13 22:40:50,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:50,797 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 674 transitions. [2024-10-13 22:40:50,797 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-10-13 22:40:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 674 transitions. [2024-10-13 22:40:50,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 22:40:50,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:50,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:40:50,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 22:40:50,803 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:50,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:50,803 INFO L85 PathProgramCache]: Analyzing trace with hash -649264889, now seen corresponding path program 1 times [2024-10-13 22:40:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:50,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841190705] [2024-10-13 22:40:50,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:50,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:50,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:50,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841190705] [2024-10-13 22:40:50,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841190705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:50,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:50,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671425754] [2024-10-13 22:40:50,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:50,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:50,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:50,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:50,856 INFO L87 Difference]: Start difference. First operand 372 states and 674 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-10-13 22:40:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:50,876 INFO L93 Difference]: Finished difference Result 480 states and 876 transitions. [2024-10-13 22:40:50,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:50,877 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-10-13 22:40:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:50,879 INFO L225 Difference]: With dead ends: 480 [2024-10-13 22:40:50,879 INFO L226 Difference]: Without dead ends: 478 [2024-10-13 22:40:50,880 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-10-13 22:40:50,880 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 67 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 257 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-10-13 22:40:50,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 257 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-13 22:40:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 372. [2024-10-13 22:40:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.8059299191374663) internal successors, (670), 371 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 670 transitions. [2024-10-13 22:40:50,896 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 670 transitions. Word has length 23 [2024-10-13 22:40:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:50,896 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 670 transitions. [2024-10-13 22:40:50,897 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-10-13 22:40:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 670 transitions. [2024-10-13 22:40:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 22:40:50,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:50,900 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-10-13 22:40:50,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 22:40:50,901 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:50,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:50,901 INFO L85 PathProgramCache]: Analyzing trace with hash -341106411, now seen corresponding path program 1 times [2024-10-13 22:40:50,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:50,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168335936] [2024-10-13 22:40:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:50,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:50,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168335936] [2024-10-13 22:40:50,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168335936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:50,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:50,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:50,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230972642] [2024-10-13 22:40:50,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:50,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:50,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:50,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:50,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:50,938 INFO L87 Difference]: Start difference. First operand 372 states and 670 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-10-13 22:40:50,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:50,958 INFO L93 Difference]: Finished difference Result 708 states and 1288 transitions. [2024-10-13 22:40:50,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:50,958 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-10-13 22:40:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:50,964 INFO L225 Difference]: With dead ends: 708 [2024-10-13 22:40:50,964 INFO L226 Difference]: Without dead ends: 706 [2024-10-13 22:40:50,965 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-10-13 22:40:50,965 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 64 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:50,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-10-13 22:40:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 512. [2024-10-13 22:40:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 1.7808219178082192) internal successors, (910), 511 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 910 transitions. [2024-10-13 22:40:50,983 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 910 transitions. Word has length 24 [2024-10-13 22:40:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:50,983 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 910 transitions. [2024-10-13 22:40:50,983 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-10-13 22:40:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 910 transitions. [2024-10-13 22:40:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 22:40:50,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:50,984 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-10-13 22:40:50,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 22:40:50,985 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:50,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1959716179, now seen corresponding path program 1 times [2024-10-13 22:40:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110185120] [2024-10-13 22:40:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:51,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:51,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110185120] [2024-10-13 22:40:51,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110185120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:51,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:51,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:51,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944970037] [2024-10-13 22:40:51,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:51,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:51,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:51,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:51,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:51,032 INFO L87 Difference]: Start difference. First operand 512 states and 910 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-10-13 22:40:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:51,061 INFO L93 Difference]: Finished difference Result 1236 states and 2208 transitions. [2024-10-13 22:40:51,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:51,062 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-10-13 22:40:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:51,066 INFO L225 Difference]: With dead ends: 1236 [2024-10-13 22:40:51,066 INFO L226 Difference]: Without dead ends: 730 [2024-10-13 22:40:51,067 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-10-13 22:40:51,068 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 70 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:51,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 213 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-10-13 22:40:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 728. [2024-10-13 22:40:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 1.7744154057771664) internal successors, (1290), 727 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1290 transitions. [2024-10-13 22:40:51,090 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1290 transitions. Word has length 24 [2024-10-13 22:40:51,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:51,091 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1290 transitions. [2024-10-13 22:40:51,091 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-10-13 22:40:51,091 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1290 transitions. [2024-10-13 22:40:51,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 22:40:51,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:51,092 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-10-13 22:40:51,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 22:40:51,092 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:51,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:51,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1984151398, now seen corresponding path program 1 times [2024-10-13 22:40:51,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:51,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362698006] [2024-10-13 22:40:51,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:51,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:51,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:51,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362698006] [2024-10-13 22:40:51,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362698006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:51,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:51,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:51,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331522600] [2024-10-13 22:40:51,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:51,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:51,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:51,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:51,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:51,123 INFO L87 Difference]: Start difference. First operand 728 states and 1290 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-10-13 22:40:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:51,145 INFO L93 Difference]: Finished difference Result 1100 states and 1944 transitions. [2024-10-13 22:40:51,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:51,145 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-10-13 22:40:51,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:51,148 INFO L225 Difference]: With dead ends: 1100 [2024-10-13 22:40:51,149 INFO L226 Difference]: Without dead ends: 742 [2024-10-13 22:40:51,150 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-10-13 22:40:51,150 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 72 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:51,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 225 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-10-13 22:40:51,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2024-10-13 22:40:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.756427604871448) internal successors, (1298), 739 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1298 transitions. [2024-10-13 22:40:51,187 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1298 transitions. Word has length 25 [2024-10-13 22:40:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:51,191 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1298 transitions. [2024-10-13 22:40:51,192 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-10-13 22:40:51,192 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1298 transitions. [2024-10-13 22:40:51,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 22:40:51,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:51,196 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-10-13 22:40:51,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 22:40:51,196 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:51,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:51,197 INFO L85 PathProgramCache]: Analyzing trace with hash 621872156, now seen corresponding path program 1 times [2024-10-13 22:40:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:51,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213058846] [2024-10-13 22:40:51,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:51,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:51,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:51,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213058846] [2024-10-13 22:40:51,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213058846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:51,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:51,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:51,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945471396] [2024-10-13 22:40:51,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:51,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:51,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:51,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:51,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:51,281 INFO L87 Difference]: Start difference. First operand 740 states and 1298 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-10-13 22:40:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:51,311 INFO L93 Difference]: Finished difference Result 1384 states and 2460 transitions. [2024-10-13 22:40:51,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:51,312 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-10-13 22:40:51,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:51,317 INFO L225 Difference]: With dead ends: 1384 [2024-10-13 22:40:51,318 INFO L226 Difference]: Without dead ends: 1382 [2024-10-13 22:40:51,318 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-10-13 22:40:51,320 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 61 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:51,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-10-13 22:40:51,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1028. [2024-10-13 22:40:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1027 states have (on average 1.7234664070107109) internal successors, (1770), 1027 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1770 transitions. [2024-10-13 22:40:51,343 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1770 transitions. Word has length 25 [2024-10-13 22:40:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:51,344 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1770 transitions. [2024-10-13 22:40:51,344 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-10-13 22:40:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1770 transitions. [2024-10-13 22:40:51,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 22:40:51,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:51,345 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-10-13 22:40:51,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 22:40:51,346 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:51,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:51,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1372272550, now seen corresponding path program 1 times [2024-10-13 22:40:51,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:51,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560333027] [2024-10-13 22:40:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:51,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:51,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:51,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560333027] [2024-10-13 22:40:51,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560333027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:51,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:51,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:51,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305377851] [2024-10-13 22:40:51,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:51,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:51,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:51,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:51,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:51,379 INFO L87 Difference]: Start difference. First operand 1028 states and 1770 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-10-13 22:40:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:51,416 INFO L93 Difference]: Finished difference Result 2456 states and 4252 transitions. [2024-10-13 22:40:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:51,417 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-10-13 22:40:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:51,422 INFO L225 Difference]: With dead ends: 2456 [2024-10-13 22:40:51,422 INFO L226 Difference]: Without dead ends: 1446 [2024-10-13 22:40:51,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:51,424 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 69 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:51,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 214 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:51,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2024-10-13 22:40:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1444. [2024-10-13 22:40:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.72002772002772) internal successors, (2482), 1443 states have internal predecessors, (2482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2482 transitions. [2024-10-13 22:40:51,459 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2482 transitions. Word has length 25 [2024-10-13 22:40:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:51,460 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 2482 transitions. [2024-10-13 22:40:51,461 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-10-13 22:40:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2482 transitions. [2024-10-13 22:40:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 22:40:51,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:51,462 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-10-13 22:40:51,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 22:40:51,462 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:51,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:51,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2098380744, now seen corresponding path program 1 times [2024-10-13 22:40:51,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:51,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654131471] [2024-10-13 22:40:51,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:51,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:51,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:51,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654131471] [2024-10-13 22:40:51,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654131471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:51,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:51,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:51,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497866301] [2024-10-13 22:40:51,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:51,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:51,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:51,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:51,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:51,493 INFO L87 Difference]: Start difference. First operand 1444 states and 2482 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-10-13 22:40:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:51,524 INFO L93 Difference]: Finished difference Result 2168 states and 3716 transitions. [2024-10-13 22:40:51,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:51,528 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-10-13 22:40:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:51,537 INFO L225 Difference]: With dead ends: 2168 [2024-10-13 22:40:51,537 INFO L226 Difference]: Without dead ends: 1462 [2024-10-13 22:40:51,538 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-10-13 22:40:51,542 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 71 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:51,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 221 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2024-10-13 22:40:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1460. [2024-10-13 22:40:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1459 states have (on average 1.7011651816312543) internal successors, (2482), 1459 states have internal predecessors, (2482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2482 transitions. [2024-10-13 22:40:51,586 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2482 transitions. Word has length 26 [2024-10-13 22:40:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:51,586 INFO L471 AbstractCegarLoop]: Abstraction has 1460 states and 2482 transitions. [2024-10-13 22:40:51,586 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-10-13 22:40:51,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2482 transitions. [2024-10-13 22:40:51,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 22:40:51,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:51,588 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-10-13 22:40:51,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 22:40:51,588 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:51,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:51,589 INFO L85 PathProgramCache]: Analyzing trace with hash 409437002, now seen corresponding path program 1 times [2024-10-13 22:40:51,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:51,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549971706] [2024-10-13 22:40:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:51,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:51,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:51,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549971706] [2024-10-13 22:40:51,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549971706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:51,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:51,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:51,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491485343] [2024-10-13 22:40:51,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:51,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:51,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:51,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:51,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:51,615 INFO L87 Difference]: Start difference. First operand 1460 states and 2482 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-10-13 22:40:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:51,654 INFO L93 Difference]: Finished difference Result 2696 states and 4660 transitions. [2024-10-13 22:40:51,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:51,654 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-10-13 22:40:51,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:51,663 INFO L225 Difference]: With dead ends: 2696 [2024-10-13 22:40:51,663 INFO L226 Difference]: Without dead ends: 2694 [2024-10-13 22:40:51,663 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-10-13 22:40:51,664 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 58 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:51,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:51,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2024-10-13 22:40:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2052. [2024-10-13 22:40:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2052 states, 2051 states have (on average 1.6626036079960995) internal successors, (3410), 2051 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 3410 transitions. [2024-10-13 22:40:51,717 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 3410 transitions. Word has length 26 [2024-10-13 22:40:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:51,717 INFO L471 AbstractCegarLoop]: Abstraction has 2052 states and 3410 transitions. [2024-10-13 22:40:51,718 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-10-13 22:40:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 3410 transitions. [2024-10-13 22:40:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 22:40:51,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:51,720 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-10-13 22:40:51,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 22:40:51,720 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:51,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1584707704, now seen corresponding path program 1 times [2024-10-13 22:40:51,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:51,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222502215] [2024-10-13 22:40:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:51,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:51,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:51,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222502215] [2024-10-13 22:40:51,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222502215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:51,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:51,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:51,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761577266] [2024-10-13 22:40:51,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:51,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:51,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:51,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:51,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:51,752 INFO L87 Difference]: Start difference. First operand 2052 states and 3410 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-10-13 22:40:51,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:51,814 INFO L93 Difference]: Finished difference Result 4872 states and 8148 transitions. [2024-10-13 22:40:51,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:51,815 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-10-13 22:40:51,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:51,823 INFO L225 Difference]: With dead ends: 4872 [2024-10-13 22:40:51,823 INFO L226 Difference]: Without dead ends: 2854 [2024-10-13 22:40:51,826 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-10-13 22:40:51,827 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:51,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 215 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2024-10-13 22:40:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2852. [2024-10-13 22:40:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.6618730270080673) internal successors, (4738), 2851 states have internal predecessors, (4738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4738 transitions. [2024-10-13 22:40:51,896 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4738 transitions. Word has length 26 [2024-10-13 22:40:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:51,896 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 4738 transitions. [2024-10-13 22:40:51,896 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-10-13 22:40:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4738 transitions. [2024-10-13 22:40:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 22:40:51,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:51,900 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-10-13 22:40:51,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 22:40:51,900 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:51,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash -192141393, now seen corresponding path program 1 times [2024-10-13 22:40:51,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:51,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610045283] [2024-10-13 22:40:51,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:51,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:51,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:51,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610045283] [2024-10-13 22:40:51,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610045283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:51,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:51,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:51,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595829106] [2024-10-13 22:40:51,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:51,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:51,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:51,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:51,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:51,934 INFO L87 Difference]: Start difference. First operand 2852 states and 4738 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-10-13 22:40:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:51,986 INFO L93 Difference]: Finished difference Result 4280 states and 7092 transitions. [2024-10-13 22:40:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:51,987 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-10-13 22:40:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:51,996 INFO L225 Difference]: With dead ends: 4280 [2024-10-13 22:40:51,996 INFO L226 Difference]: Without dead ends: 2886 [2024-10-13 22:40:51,998 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-10-13 22:40:51,999 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 70 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:52,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 217 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:52,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2024-10-13 22:40:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2884. [2024-10-13 22:40:52,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2883 states have (on average 1.6434269857787027) internal successors, (4738), 2883 states have internal predecessors, (4738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4738 transitions. [2024-10-13 22:40:52,083 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4738 transitions. Word has length 27 [2024-10-13 22:40:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:52,084 INFO L471 AbstractCegarLoop]: Abstraction has 2884 states and 4738 transitions. [2024-10-13 22:40:52,084 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-10-13 22:40:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4738 transitions. [2024-10-13 22:40:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 22:40:52,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:52,086 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-10-13 22:40:52,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 22:40:52,086 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:52,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1881085135, now seen corresponding path program 1 times [2024-10-13 22:40:52,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:52,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404969174] [2024-10-13 22:40:52,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:52,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:52,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404969174] [2024-10-13 22:40:52,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404969174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:52,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:52,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:52,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072918881] [2024-10-13 22:40:52,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:52,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:52,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:52,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:52,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:52,117 INFO L87 Difference]: Start difference. First operand 2884 states and 4738 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-10-13 22:40:52,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:52,197 INFO L93 Difference]: Finished difference Result 5256 states and 8804 transitions. [2024-10-13 22:40:52,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:52,198 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-10-13 22:40:52,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:52,215 INFO L225 Difference]: With dead ends: 5256 [2024-10-13 22:40:52,215 INFO L226 Difference]: Without dead ends: 5254 [2024-10-13 22:40:52,217 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-10-13 22:40:52,218 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 55 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:52,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:52,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2024-10-13 22:40:52,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 4100. [2024-10-13 22:40:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4100 states, 4099 states have (on average 1.6008782629909735) internal successors, (6562), 4099 states have internal predecessors, (6562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 6562 transitions. [2024-10-13 22:40:52,335 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 6562 transitions. Word has length 27 [2024-10-13 22:40:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:52,335 INFO L471 AbstractCegarLoop]: Abstraction has 4100 states and 6562 transitions. [2024-10-13 22:40:52,335 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-10-13 22:40:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 6562 transitions. [2024-10-13 22:40:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 22:40:52,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:52,340 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-10-13 22:40:52,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 22:40:52,340 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:52,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:52,341 INFO L85 PathProgramCache]: Analyzing trace with hash 419737455, now seen corresponding path program 1 times [2024-10-13 22:40:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:52,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379534019] [2024-10-13 22:40:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:52,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:52,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:52,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379534019] [2024-10-13 22:40:52,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379534019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:52,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:52,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202782781] [2024-10-13 22:40:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:52,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:52,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:52,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:52,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:52,369 INFO L87 Difference]: Start difference. First operand 4100 states and 6562 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-10-13 22:40:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:52,464 INFO L93 Difference]: Finished difference Result 9672 states and 15588 transitions. [2024-10-13 22:40:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:52,464 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-10-13 22:40:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:52,494 INFO L225 Difference]: With dead ends: 9672 [2024-10-13 22:40:52,494 INFO L226 Difference]: Without dead ends: 5638 [2024-10-13 22:40:52,499 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-10-13 22:40:52,500 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:52,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 216 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2024-10-13 22:40:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 5636. [2024-10-13 22:40:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5636 states, 5635 states have (on average 1.6017746228926353) internal successors, (9026), 5635 states have internal predecessors, (9026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5636 states to 5636 states and 9026 transitions. [2024-10-13 22:40:52,713 INFO L78 Accepts]: Start accepts. Automaton has 5636 states and 9026 transitions. Word has length 27 [2024-10-13 22:40:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:52,713 INFO L471 AbstractCegarLoop]: Abstraction has 5636 states and 9026 transitions. [2024-10-13 22:40:52,713 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-10-13 22:40:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5636 states and 9026 transitions. [2024-10-13 22:40:52,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 22:40:52,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:52,720 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-10-13 22:40:52,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 22:40:52,720 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:52,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:52,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1816116733, now seen corresponding path program 1 times [2024-10-13 22:40:52,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:52,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414283081] [2024-10-13 22:40:52,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:52,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:52,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:52,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414283081] [2024-10-13 22:40:52,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414283081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:52,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:52,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:52,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106422177] [2024-10-13 22:40:52,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:52,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:52,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:52,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:52,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:52,762 INFO L87 Difference]: Start difference. First operand 5636 states and 9026 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-10-13 22:40:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:52,883 INFO L93 Difference]: Finished difference Result 8456 states and 13508 transitions. [2024-10-13 22:40:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:52,884 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-10-13 22:40:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:52,901 INFO L225 Difference]: With dead ends: 8456 [2024-10-13 22:40:52,901 INFO L226 Difference]: Without dead ends: 5702 [2024-10-13 22:40:52,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-10-13 22:40:52,907 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:52,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2024-10-13 22:40:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 5700. [2024-10-13 22:40:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5700 states, 5699 states have (on average 1.5837866292331988) internal successors, (9026), 5699 states have internal predecessors, (9026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 9026 transitions. [2024-10-13 22:40:53,041 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 9026 transitions. Word has length 28 [2024-10-13 22:40:53,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:53,041 INFO L471 AbstractCegarLoop]: Abstraction has 5700 states and 9026 transitions. [2024-10-13 22:40:53,042 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-10-13 22:40:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 9026 transitions. [2024-10-13 22:40:53,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 22:40:53,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:53,047 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-10-13 22:40:53,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 22:40:53,047 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:53,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:53,049 INFO L85 PathProgramCache]: Analyzing trace with hash 127172991, now seen corresponding path program 1 times [2024-10-13 22:40:53,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:53,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476346658] [2024-10-13 22:40:53,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:53,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:53,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476346658] [2024-10-13 22:40:53,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476346658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:53,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:53,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:53,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62570247] [2024-10-13 22:40:53,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:53,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:53,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:53,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:53,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:53,081 INFO L87 Difference]: Start difference. First operand 5700 states and 9026 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-10-13 22:40:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:53,237 INFO L93 Difference]: Finished difference Result 10248 states and 16580 transitions. [2024-10-13 22:40:53,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:53,238 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-10-13 22:40:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:53,254 INFO L225 Difference]: With dead ends: 10248 [2024-10-13 22:40:53,255 INFO L226 Difference]: Without dead ends: 10246 [2024-10-13 22:40:53,257 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-10-13 22:40:53,258 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 52 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:53,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 170 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10246 states. [2024-10-13 22:40:53,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10246 to 8196. [2024-10-13 22:40:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8196 states, 8195 states have (on average 1.5387431360585724) internal successors, (12610), 8195 states have internal predecessors, (12610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 12610 transitions. [2024-10-13 22:40:53,424 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 12610 transitions. Word has length 28 [2024-10-13 22:40:53,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:53,425 INFO L471 AbstractCegarLoop]: Abstraction has 8196 states and 12610 transitions. [2024-10-13 22:40:53,425 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-10-13 22:40:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 12610 transitions. [2024-10-13 22:40:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 22:40:53,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:53,434 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-10-13 22:40:53,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 22:40:53,434 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:53,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1866971715, now seen corresponding path program 1 times [2024-10-13 22:40:53,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:53,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324814497] [2024-10-13 22:40:53,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:53,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:53,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:53,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324814497] [2024-10-13 22:40:53,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324814497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:53,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:53,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:53,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353671664] [2024-10-13 22:40:53,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:53,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:53,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:53,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:53,458 INFO L87 Difference]: Start difference. First operand 8196 states and 12610 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-10-13 22:40:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:53,614 INFO L93 Difference]: Finished difference Result 19208 states and 29764 transitions. [2024-10-13 22:40:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:53,614 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-10-13 22:40:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:53,633 INFO L225 Difference]: With dead ends: 19208 [2024-10-13 22:40:53,633 INFO L226 Difference]: Without dead ends: 11142 [2024-10-13 22:40:53,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:53,643 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 66 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:53,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 217 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2024-10-13 22:40:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 11140. [2024-10-13 22:40:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11140 states, 11139 states have (on average 1.5399946135200646) internal successors, (17154), 11139 states have internal predecessors, (17154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11140 states to 11140 states and 17154 transitions. [2024-10-13 22:40:53,919 INFO L78 Accepts]: Start accepts. Automaton has 11140 states and 17154 transitions. Word has length 28 [2024-10-13 22:40:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:53,919 INFO L471 AbstractCegarLoop]: Abstraction has 11140 states and 17154 transitions. [2024-10-13 22:40:53,919 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-10-13 22:40:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 11140 states and 17154 transitions. [2024-10-13 22:40:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 22:40:53,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:53,929 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-10-13 22:40:53,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 22:40:53,929 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:53,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:53,930 INFO L85 PathProgramCache]: Analyzing trace with hash -352390460, now seen corresponding path program 1 times [2024-10-13 22:40:53,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:53,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877269015] [2024-10-13 22:40:53,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:53,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:53,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:53,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877269015] [2024-10-13 22:40:53,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877269015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:53,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:53,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:53,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821287378] [2024-10-13 22:40:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:53,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:53,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:53,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:53,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:53,952 INFO L87 Difference]: Start difference. First operand 11140 states and 17154 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-10-13 22:40:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:54,100 INFO L93 Difference]: Finished difference Result 16712 states and 25668 transitions. [2024-10-13 22:40:54,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:54,101 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-10-13 22:40:54,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:54,122 INFO L225 Difference]: With dead ends: 16712 [2024-10-13 22:40:54,122 INFO L226 Difference]: Without dead ends: 11270 [2024-10-13 22:40:54,131 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-10-13 22:40:54,132 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 68 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:54,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 209 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11270 states. [2024-10-13 22:40:54,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11270 to 11268. [2024-10-13 22:40:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11268 states, 11267 states have (on average 1.5224993343392208) internal successors, (17154), 11267 states have internal predecessors, (17154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 17154 transitions. [2024-10-13 22:40:54,507 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 17154 transitions. Word has length 29 [2024-10-13 22:40:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:54,507 INFO L471 AbstractCegarLoop]: Abstraction has 11268 states and 17154 transitions. [2024-10-13 22:40:54,508 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-10-13 22:40:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 17154 transitions. [2024-10-13 22:40:54,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 22:40:54,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:54,518 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-10-13 22:40:54,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 22:40:54,519 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:54,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2041334202, now seen corresponding path program 1 times [2024-10-13 22:40:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:54,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944590808] [2024-10-13 22:40:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:54,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:54,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944590808] [2024-10-13 22:40:54,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944590808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:54,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:54,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:54,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159224675] [2024-10-13 22:40:54,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:54,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:54,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:54,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:54,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:54,566 INFO L87 Difference]: Start difference. First operand 11268 states and 17154 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-10-13 22:40:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:54,854 INFO L93 Difference]: Finished difference Result 19976 states and 31108 transitions. [2024-10-13 22:40:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:54,855 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-10-13 22:40:54,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:54,886 INFO L225 Difference]: With dead ends: 19976 [2024-10-13 22:40:54,886 INFO L226 Difference]: Without dead ends: 19974 [2024-10-13 22:40:54,889 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-10-13 22:40:54,890 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:54,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 168 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:54,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19974 states. [2024-10-13 22:40:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19974 to 16388. [2024-10-13 22:40:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16388 states, 16387 states have (on average 1.4764142307927015) internal successors, (24194), 16387 states have internal predecessors, (24194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16388 states to 16388 states and 24194 transitions. [2024-10-13 22:40:55,158 INFO L78 Accepts]: Start accepts. Automaton has 16388 states and 24194 transitions. Word has length 29 [2024-10-13 22:40:55,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:55,159 INFO L471 AbstractCegarLoop]: Abstraction has 16388 states and 24194 transitions. [2024-10-13 22:40:55,162 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-10-13 22:40:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 16388 states and 24194 transitions. [2024-10-13 22:40:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 22:40:55,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:55,177 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-10-13 22:40:55,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 22:40:55,178 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:55,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:55,178 INFO L85 PathProgramCache]: Analyzing trace with hash 259488388, now seen corresponding path program 1 times [2024-10-13 22:40:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:55,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681014110] [2024-10-13 22:40:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:55,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:55,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:55,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681014110] [2024-10-13 22:40:55,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681014110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:55,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:55,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:55,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311579459] [2024-10-13 22:40:55,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:55,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:55,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:55,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:55,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:55,198 INFO L87 Difference]: Start difference. First operand 16388 states and 24194 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-10-13 22:40:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:55,478 INFO L93 Difference]: Finished difference Result 38152 states and 56708 transitions. [2024-10-13 22:40:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:55,479 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-10-13 22:40:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:55,517 INFO L225 Difference]: With dead ends: 38152 [2024-10-13 22:40:55,517 INFO L226 Difference]: Without dead ends: 22022 [2024-10-13 22:40:55,538 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-10-13 22:40:55,539 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:55,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 218 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22022 states. [2024-10-13 22:40:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22022 to 22020. [2024-10-13 22:40:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22020 states, 22019 states have (on average 1.4766338162496027) internal successors, (32514), 22019 states have internal predecessors, (32514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22020 states to 22020 states and 32514 transitions. [2024-10-13 22:40:56,072 INFO L78 Accepts]: Start accepts. Automaton has 22020 states and 32514 transitions. Word has length 29 [2024-10-13 22:40:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:56,072 INFO L471 AbstractCegarLoop]: Abstraction has 22020 states and 32514 transitions. [2024-10-13 22:40:56,072 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-10-13 22:40:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 22020 states and 32514 transitions. [2024-10-13 22:40:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 22:40:56,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:56,094 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-10-13 22:40:56,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 22:40:56,094 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:56,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:56,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1143363634, now seen corresponding path program 1 times [2024-10-13 22:40:56,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:56,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218932123] [2024-10-13 22:40:56,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:56,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:56,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:56,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218932123] [2024-10-13 22:40:56,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218932123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:56,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:56,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:56,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263643474] [2024-10-13 22:40:56,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:56,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:56,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:56,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:56,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:56,125 INFO L87 Difference]: Start difference. First operand 22020 states and 32514 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-10-13 22:40:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:56,442 INFO L93 Difference]: Finished difference Result 33032 states and 48644 transitions. [2024-10-13 22:40:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:56,443 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-10-13 22:40:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:56,477 INFO L225 Difference]: With dead ends: 33032 [2024-10-13 22:40:56,477 INFO L226 Difference]: Without dead ends: 22278 [2024-10-13 22:40:56,495 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-10-13 22:40:56,496 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:56,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22278 states. [2024-10-13 22:40:57,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22278 to 22276. [2024-10-13 22:40:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22276 states, 22275 states have (on average 1.4596632996632997) internal successors, (32514), 22275 states have internal predecessors, (32514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22276 states to 22276 states and 32514 transitions. [2024-10-13 22:40:57,086 INFO L78 Accepts]: Start accepts. Automaton has 22276 states and 32514 transitions. Word has length 30 [2024-10-13 22:40:57,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:57,086 INFO L471 AbstractCegarLoop]: Abstraction has 22276 states and 32514 transitions. [2024-10-13 22:40:57,086 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-10-13 22:40:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 22276 states and 32514 transitions. [2024-10-13 22:40:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 22:40:57,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:57,102 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-10-13 22:40:57,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 22:40:57,102 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:57,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:57,103 INFO L85 PathProgramCache]: Analyzing trace with hash -545580108, now seen corresponding path program 1 times [2024-10-13 22:40:57,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:57,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540407758] [2024-10-13 22:40:57,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:57,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:57,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:57,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540407758] [2024-10-13 22:40:57,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540407758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:57,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:57,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:57,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937612663] [2024-10-13 22:40:57,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:57,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:57,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:57,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:57,123 INFO L87 Difference]: Start difference. First operand 22276 states and 32514 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-10-13 22:40:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:57,497 INFO L93 Difference]: Finished difference Result 38920 states and 58116 transitions. [2024-10-13 22:40:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:57,497 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-10-13 22:40:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:57,550 INFO L225 Difference]: With dead ends: 38920 [2024-10-13 22:40:57,551 INFO L226 Difference]: Without dead ends: 38918 [2024-10-13 22:40:57,563 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-10-13 22:40:57,564 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 46 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:57,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:57,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38918 states. [2024-10-13 22:40:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38918 to 32772. [2024-10-13 22:40:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32772 states, 32771 states have (on average 1.4139940801318238) internal successors, (46338), 32771 states have internal predecessors, (46338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32772 states to 32772 states and 46338 transitions. [2024-10-13 22:40:58,251 INFO L78 Accepts]: Start accepts. Automaton has 32772 states and 46338 transitions. Word has length 30 [2024-10-13 22:40:58,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:58,251 INFO L471 AbstractCegarLoop]: Abstraction has 32772 states and 46338 transitions. [2024-10-13 22:40:58,252 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-10-13 22:40:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 32772 states and 46338 transitions. [2024-10-13 22:40:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 22:40:58,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:58,276 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-10-13 22:40:58,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 22:40:58,276 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:58,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:58,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1755242482, now seen corresponding path program 1 times [2024-10-13 22:40:58,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:58,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475940052] [2024-10-13 22:40:58,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:58,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:58,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:58,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475940052] [2024-10-13 22:40:58,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475940052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:58,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:58,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:58,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899456967] [2024-10-13 22:40:58,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:58,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:58,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:58,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:58,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:58,300 INFO L87 Difference]: Start difference. First operand 32772 states and 46338 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-10-13 22:40:58,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:58,840 INFO L93 Difference]: Finished difference Result 75784 states and 107780 transitions. [2024-10-13 22:40:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:58,841 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-10-13 22:40:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:59,020 INFO L225 Difference]: With dead ends: 75784 [2024-10-13 22:40:59,020 INFO L226 Difference]: Without dead ends: 43526 [2024-10-13 22:40:59,047 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-10-13 22:40:59,048 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:59,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 219 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43526 states. [2024-10-13 22:40:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43526 to 43524. [2024-10-13 22:40:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43524 states, 43523 states have (on average 1.411713346965972) internal successors, (61442), 43523 states have internal predecessors, (61442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43524 states to 43524 states and 61442 transitions. [2024-10-13 22:40:59,993 INFO L78 Accepts]: Start accepts. Automaton has 43524 states and 61442 transitions. Word has length 30 [2024-10-13 22:40:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:59,993 INFO L471 AbstractCegarLoop]: Abstraction has 43524 states and 61442 transitions. [2024-10-13 22:40:59,993 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-10-13 22:40:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 43524 states and 61442 transitions. [2024-10-13 22:41:00,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 22:41:00,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:41:00,016 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-10-13 22:41:00,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 22:41:00,016 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:41:00,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:41:00,018 INFO L85 PathProgramCache]: Analyzing trace with hash 267100633, now seen corresponding path program 1 times [2024-10-13 22:41:00,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:41:00,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646906710] [2024-10-13 22:41:00,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:41:00,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:41:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:41:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:41:00,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:41:00,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646906710] [2024-10-13 22:41:00,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646906710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:41:00,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:41:00,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:41:00,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509955657] [2024-10-13 22:41:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:41:00,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:41:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:41:00,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:41:00,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:41:00,038 INFO L87 Difference]: Start difference. First operand 43524 states and 61442 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-10-13 22:41:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:41:00,645 INFO L93 Difference]: Finished difference Result 65288 states and 91908 transitions. [2024-10-13 22:41:00,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:41:00,646 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-10-13 22:41:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:41:00,692 INFO L225 Difference]: With dead ends: 65288 [2024-10-13 22:41:00,693 INFO L226 Difference]: Without dead ends: 44038 [2024-10-13 22:41:00,712 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-10-13 22:41:00,713 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:41:00,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 201 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:41:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44038 states. [2024-10-13 22:41:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44038 to 44036. [2024-10-13 22:41:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44036 states, 44035 states have (on average 1.3952991938230952) internal successors, (61442), 44035 states have internal predecessors, (61442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:41:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44036 states to 44036 states and 61442 transitions. [2024-10-13 22:41:01,485 INFO L78 Accepts]: Start accepts. Automaton has 44036 states and 61442 transitions. Word has length 31 [2024-10-13 22:41:01,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:41:01,486 INFO L471 AbstractCegarLoop]: Abstraction has 44036 states and 61442 transitions. [2024-10-13 22:41:01,486 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-10-13 22:41:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 44036 states and 61442 transitions. [2024-10-13 22:41:01,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 22:41:01,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:41:01,505 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-10-13 22:41:01,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 22:41:01,505 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:41:01,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:41:01,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1421843109, now seen corresponding path program 1 times [2024-10-13 22:41:01,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:41:01,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615630352] [2024-10-13 22:41:01,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:41:01,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:41:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:41:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:41:01,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:41:01,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615630352] [2024-10-13 22:41:01,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615630352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:41:01,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:41:01,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:41:01,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239284254] [2024-10-13 22:41:01,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:41:01,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:41:01,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:41:01,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:41:01,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:41:01,529 INFO L87 Difference]: Start difference. First operand 44036 states and 61442 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-10-13 22:41:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:41:02,716 INFO L93 Difference]: Finished difference Result 129032 states and 178180 transitions. [2024-10-13 22:41:02,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:41:02,716 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-10-13 22:41:02,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:41:02,815 INFO L225 Difference]: With dead ends: 129032 [2024-10-13 22:41:02,815 INFO L226 Difference]: Without dead ends: 86022 [2024-10-13 22:41:02,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:41:02,850 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:41:02,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 184 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:41:02,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86022 states. [2024-10-13 22:41:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86022 to 86020. [2024-10-13 22:41:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86020 states, 86019 states have (on average 1.3571187760843535) internal successors, (116738), 86019 states have internal predecessors, (116738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:41:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86020 states to 86020 states and 116738 transitions. [2024-10-13 22:41:04,421 INFO L78 Accepts]: Start accepts. Automaton has 86020 states and 116738 transitions. Word has length 31 [2024-10-13 22:41:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:41:04,422 INFO L471 AbstractCegarLoop]: Abstraction has 86020 states and 116738 transitions. [2024-10-13 22:41:04,422 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-10-13 22:41:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 86020 states and 116738 transitions. [2024-10-13 22:41:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 22:41:04,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:41:04,476 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-10-13 22:41:04,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-13 22:41:04,476 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:41:04,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:41:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash 572301597, now seen corresponding path program 1 times [2024-10-13 22:41:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:41:04,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423283421] [2024-10-13 22:41:04,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:41:04,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:41:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:41:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:41:04,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:41:04,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423283421] [2024-10-13 22:41:04,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423283421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:41:04,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:41:04,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:41:04,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562735898] [2024-10-13 22:41:04,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:41:04,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:41:04,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:41:04,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:41:04,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:41:04,509 INFO L87 Difference]: Start difference. First operand 86020 states and 116738 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-10-13 22:41:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:41:05,721 INFO L93 Difference]: Finished difference Result 96264 states and 135172 transitions. [2024-10-13 22:41:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:41:05,722 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-10-13 22:41:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:41:05,875 INFO L225 Difference]: With dead ends: 96264 [2024-10-13 22:41:05,876 INFO L226 Difference]: Without dead ends: 96262 [2024-10-13 22:41:05,888 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-10-13 22:41:05,889 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 43 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 217 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-10-13 22:41:05,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 217 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:41:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96262 states. [2024-10-13 22:41:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96262 to 86020. [2024-10-13 22:41:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86020 states, 86019 states have (on average 1.3452144293702555) internal successors, (115714), 86019 states have internal predecessors, (115714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:41:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86020 states to 86020 states and 115714 transitions. [2024-10-13 22:41:07,601 INFO L78 Accepts]: Start accepts. Automaton has 86020 states and 115714 transitions. Word has length 31 [2024-10-13 22:41:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:41:07,602 INFO L471 AbstractCegarLoop]: Abstraction has 86020 states and 115714 transitions. [2024-10-13 22:41:07,602 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-10-13 22:41:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 86020 states and 115714 transitions. [2024-10-13 22:41:07,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 22:41:07,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:41:07,628 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-10-13 22:41:07,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-13 22:41:07,629 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:41:07,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:41:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1127248281, now seen corresponding path program 1 times [2024-10-13 22:41:07,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:41:07,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185563210] [2024-10-13 22:41:07,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:41:07,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:41:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:41:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:41:07,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:41:07,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185563210] [2024-10-13 22:41:07,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185563210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:41:07,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:41:07,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:41:07,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358689388] [2024-10-13 22:41:07,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:41:07,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:41:07,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:41:07,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:41:07,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:41:07,656 INFO L87 Difference]: Start difference. First operand 86020 states and 115714 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-10-13 22:41:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:41:09,393 INFO L93 Difference]: Finished difference Result 146440 states and 200708 transitions. [2024-10-13 22:41:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:41:09,394 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-10-13 22:41:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:41:09,555 INFO L225 Difference]: With dead ends: 146440 [2024-10-13 22:41:09,556 INFO L226 Difference]: Without dead ends: 146438 [2024-10-13 22:41:09,580 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-10-13 22:41:09,580 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 40 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:41:09,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:41:09,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146438 states. [2024-10-13 22:41:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146438 to 130052. [2024-10-13 22:41:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130052 states, 130051 states have (on average 1.307071841046974) internal successors, (169986), 130051 states have internal predecessors, (169986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:41:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130052 states to 130052 states and 169986 transitions. [2024-10-13 22:41:12,073 INFO L78 Accepts]: Start accepts. Automaton has 130052 states and 169986 transitions. Word has length 32 [2024-10-13 22:41:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:41:12,074 INFO L471 AbstractCegarLoop]: Abstraction has 130052 states and 169986 transitions. [2024-10-13 22:41:12,074 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-10-13 22:41:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 130052 states and 169986 transitions. [2024-10-13 22:41:12,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 22:41:12,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:41:12,140 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-10-13 22:41:12,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-13 22:41:12,140 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:41:12,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:41:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1173574309, now seen corresponding path program 1 times [2024-10-13 22:41:12,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:41:12,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205199613] [2024-10-13 22:41:12,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:41:12,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:41:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:41:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:41:12,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:41:12,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205199613] [2024-10-13 22:41:12,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205199613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:41:12,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:41:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:41:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402304086] [2024-10-13 22:41:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:41:12,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:41:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:41:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:41:12,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:41:12,162 INFO L87 Difference]: Start difference. First operand 130052 states and 169986 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-10-13 22:41:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:41:14,403 INFO L93 Difference]: Finished difference Result 297992 states and 391172 transitions. [2024-10-13 22:41:14,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:41:14,404 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-10-13 22:41:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:41:14,639 INFO L225 Difference]: With dead ends: 297992 [2024-10-13 22:41:14,640 INFO L226 Difference]: Without dead ends: 168966 [2024-10-13 22:41:14,711 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-10-13 22:41:14,712 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:41:14,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 221 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:41:14,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168966 states. [2024-10-13 22:41:17,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168966 to 168964. [2024-10-13 22:41:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168964 states, 168963 states have (on average 1.2969585057083504) internal successors, (219138), 168963 states have internal predecessors, (219138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:41:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168964 states to 168964 states and 219138 transitions. [2024-10-13 22:41:18,218 INFO L78 Accepts]: Start accepts. Automaton has 168964 states and 219138 transitions. Word has length 32 [2024-10-13 22:41:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:41:18,219 INFO L471 AbstractCegarLoop]: Abstraction has 168964 states and 219138 transitions. [2024-10-13 22:41:18,219 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-10-13 22:41:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 168964 states and 219138 transitions. [2024-10-13 22:41:18,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 22:41:18,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:41:18,312 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-10-13 22:41:18,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-13 22:41:18,313 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:41:18,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:41:18,313 INFO L85 PathProgramCache]: Analyzing trace with hash -584742864, now seen corresponding path program 1 times [2024-10-13 22:41:18,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:41:18,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925921045] [2024-10-13 22:41:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:41:18,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:41:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:41:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:41:18,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:41:18,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925921045] [2024-10-13 22:41:18,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925921045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:41:18,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:41:18,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:41:18,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199821526] [2024-10-13 22:41:18,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:41:18,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:41:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:41:18,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:41:18,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:41:18,674 INFO L87 Difference]: Start difference. First operand 168964 states and 219138 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-10-13 22:41:20,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:41:20,752 INFO L93 Difference]: Finished difference Result 254984 states and 330756 transitions. [2024-10-13 22:41:20,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:41:20,753 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-10-13 22:41:20,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:41:20,966 INFO L225 Difference]: With dead ends: 254984 [2024-10-13 22:41:20,966 INFO L226 Difference]: Without dead ends: 172038 [2024-10-13 22:41:21,023 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-10-13 22:41:21,023 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 64 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:41:21,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:41:21,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172038 states. [2024-10-13 22:41:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172038 to 172036. [2024-10-13 22:41:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172036 states, 172035 states have (on average 1.2857034905687796) internal successors, (221186), 172035 states have internal predecessors, (221186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:41:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172036 states to 172036 states and 221186 transitions. [2024-10-13 22:41:24,444 INFO L78 Accepts]: Start accepts. Automaton has 172036 states and 221186 transitions. Word has length 33 [2024-10-13 22:41:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:41:24,444 INFO L471 AbstractCegarLoop]: Abstraction has 172036 states and 221186 transitions. [2024-10-13 22:41:24,444 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-10-13 22:41:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 172036 states and 221186 transitions. [2024-10-13 22:41:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 22:41:24,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:41:24,499 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-10-13 22:41:24,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-13 22:41:24,499 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:41:24,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:41:24,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2021280690, now seen corresponding path program 1 times [2024-10-13 22:41:24,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:41:24,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780071719] [2024-10-13 22:41:24,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:41:24,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:41:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:41:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:41:24,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:41:24,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780071719] [2024-10-13 22:41:24,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780071719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:41:24,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:41:24,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:41:24,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194541368] [2024-10-13 22:41:24,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:41:24,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:41:24,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:41:24,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:41:24,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:41:24,521 INFO L87 Difference]: Start difference. First operand 172036 states and 221186 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-10-13 22:41:27,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:41:27,551 INFO L93 Difference]: Finished difference Result 286728 states and 372740 transitions. [2024-10-13 22:41:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:41:27,552 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-10-13 22:41:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:41:27,927 INFO L225 Difference]: With dead ends: 286728 [2024-10-13 22:41:27,927 INFO L226 Difference]: Without dead ends: 286726 [2024-10-13 22:41:27,972 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-10-13 22:41:27,972 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 37 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:41:27,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:41:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286726 states. [2024-10-13 22:41:31,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286726 to 262148. [2024-10-13 22:41:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262148 states, 262147 states have (on average 1.2499933243561818) internal successors, (327682), 262147 states have internal predecessors, (327682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)