./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label01.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 b034b25c13122a131dcef5e20457a6ebe39c9d7c5637a670f7b0b39a233b1f7a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:34:40,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:34:40,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:34:40,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:34:40,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:34:40,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:34:40,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:34:40,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:34:40,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:34:40,508 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:34:40,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:34:40,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:34:40,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:34:40,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:34:40,510 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:34:40,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:34:40,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:34:40,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:34:40,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:34:40,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:34:40,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:34:40,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:34:40,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:34:40,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:34:40,512 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:34:40,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:34:40,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:34:40,513 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:34:40,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:34:40,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:34:40,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:34:40,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:34:40,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:34:40,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:34:40,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:34:40,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:34:40,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:34:40,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:34:40,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:34:40,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:34:40,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:34:40,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:34:40,517 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 -> b034b25c13122a131dcef5e20457a6ebe39c9d7c5637a670f7b0b39a233b1f7a [2024-11-11 22:34:40,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:34:40,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:34:40,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:34:40,747 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:34:40,747 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:34:40,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label01.c [2024-11-11 22:34:41,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:34:42,270 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:34:42,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label01.c [2024-11-11 22:34:42,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55db1ee7d/ef764054ee904b6597cd2b910ed9c3ab/FLAGea713d1a7 [2024-11-11 22:34:42,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55db1ee7d/ef764054ee904b6597cd2b910ed9c3ab [2024-11-11 22:34:42,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:34:42,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:34:42,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:34:42,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:34:42,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:34:42,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:34:42" (1/1) ... [2024-11-11 22:34:42,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a6f3b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:42, skipping insertion in model container [2024-11-11 22:34:42,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:34:42" (1/1) ... [2024-11-11 22:34:42,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:34:42,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label01.c[6354,6367] [2024-11-11 22:34:42,904 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label01.c[11909,11922] [2024-11-11 22:34:43,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:34:43,397 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:34:43,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label01.c[6354,6367] [2024-11-11 22:34:43,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label01.c[11909,11922] [2024-11-11 22:34:43,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:34:43,731 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:34:43,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:43 WrapperNode [2024-11-11 22:34:43,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:34:43,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:34:43,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:34:43,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:34:43,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:43" (1/1) ... [2024-11-11 22:34:43,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:43" (1/1) ... [2024-11-11 22:34:44,047 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4983 [2024-11-11 22:34:44,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:34:44,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:34:44,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:34:44,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:34:44,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:43" (1/1) ... [2024-11-11 22:34:44,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:43" (1/1) ... [2024-11-11 22:34:44,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:43" (1/1) ... [2024-11-11 22:34:44,244 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 22:34:44,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:43" (1/1) ... [2024-11-11 22:34:44,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:43" (1/1) ... [2024-11-11 22:34:44,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:43" (1/1) ... [2024-11-11 22:34:44,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:43" (1/1) ... [2024-11-11 22:34:44,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:43" (1/1) ... [2024-11-11 22:34:44,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:43" (1/1) ... [2024-11-11 22:34:44,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:34:44,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:34:44,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:34:44,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:34:44,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:43" (1/1) ... [2024-11-11 22:34:44,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:34:44,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:44,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:34:44,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:34:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:34:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:34:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:34:44,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:34:44,647 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:34:44,649 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:34:47,661 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2024-11-11 22:34:47,662 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:34:47,686 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:34:47,686 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 22:34:47,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:34:47 BoogieIcfgContainer [2024-11-11 22:34:47,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:34:47,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:34:47,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:34:47,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:34:47,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:34:42" (1/3) ... [2024-11-11 22:34:47,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387b6e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:34:47, skipping insertion in model container [2024-11-11 22:34:47,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:34:43" (2/3) ... [2024-11-11 22:34:47,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387b6e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:34:47, skipping insertion in model container [2024-11-11 22:34:47,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:34:47" (3/3) ... [2024-11-11 22:34:47,692 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label01.c [2024-11-11 22:34:47,706 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:34:47,707 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:34:47,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:34:47,777 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;@298c6a1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:34:47,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:34:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 872 states, 869 states have (on average 1.906789413118527) internal successors, (1657), 871 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:47,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 22:34:47,789 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:47,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:47,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:47,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:47,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1537187155, now seen corresponding path program 1 times [2024-11-11 22:34:47,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:47,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145530288] [2024-11-11 22:34:47,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:47,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:47,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145530288] [2024-11-11 22:34:47,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145530288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:47,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:47,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:34:47,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636270101] [2024-11-11 22:34:47,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:47,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 22:34:47,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:48,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 22:34:48,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 22:34:48,014 INFO L87 Difference]: Start difference. First operand has 872 states, 869 states have (on average 1.906789413118527) internal successors, (1657), 871 states have internal predecessors, (1657), 0 states have call successors, (0), 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 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:48,127 INFO L93 Difference]: Finished difference Result 1722 states and 3274 transitions. [2024-11-11 22:34:48,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 22:34:48,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-11 22:34:48,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:48,148 INFO L225 Difference]: With dead ends: 1722 [2024-11-11 22:34:48,148 INFO L226 Difference]: Without dead ends: 806 [2024-11-11 22:34:48,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 22:34:48,160 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:48,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-11 22:34:48,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2024-11-11 22:34:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8955223880597014) internal successors, (1524), 805 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1524 transitions. [2024-11-11 22:34:48,224 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1524 transitions. Word has length 20 [2024-11-11 22:34:48,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:48,225 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1524 transitions. [2024-11-11 22:34:48,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,225 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1524 transitions. [2024-11-11 22:34:48,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 22:34:48,226 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:48,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:48,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:34:48,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:48,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:48,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1746662891, now seen corresponding path program 1 times [2024-11-11 22:34:48,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:48,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074217858] [2024-11-11 22:34:48,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:48,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:48,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:48,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074217858] [2024-11-11 22:34:48,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074217858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:48,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:48,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:48,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152744576] [2024-11-11 22:34:48,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:48,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:48,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:48,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:48,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:48,394 INFO L87 Difference]: Start difference. First operand 806 states and 1524 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:48,457 INFO L93 Difference]: Finished difference Result 870 states and 1622 transitions. [2024-11-11 22:34:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:48,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-11 22:34:48,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:48,461 INFO L225 Difference]: With dead ends: 870 [2024-11-11 22:34:48,461 INFO L226 Difference]: Without dead ends: 836 [2024-11-11 22:34:48,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:48,462 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 46 mSDsluCounter, 4538 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 6058 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:48,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 6058 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:48,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2024-11-11 22:34:48,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 806. [2024-11-11 22:34:48,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8756218905472637) internal successors, (1508), 805 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1508 transitions. [2024-11-11 22:34:48,476 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1508 transitions. Word has length 20 [2024-11-11 22:34:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:48,476 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1508 transitions. [2024-11-11 22:34:48,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1508 transitions. [2024-11-11 22:34:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 22:34:48,478 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:48,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:48,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:34:48,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:48,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash 623816355, now seen corresponding path program 1 times [2024-11-11 22:34:48,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:48,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664880999] [2024-11-11 22:34:48,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:48,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:48,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:48,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664880999] [2024-11-11 22:34:48,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664880999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:48,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:48,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:48,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324817907] [2024-11-11 22:34:48,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:48,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:48,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:48,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:48,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:48,604 INFO L87 Difference]: Start difference. First operand 806 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:48,711 INFO L93 Difference]: Finished difference Result 986 states and 1790 transitions. [2024-11-11 22:34:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:34:48,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-11 22:34:48,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:48,715 INFO L225 Difference]: With dead ends: 986 [2024-11-11 22:34:48,715 INFO L226 Difference]: Without dead ends: 956 [2024-11-11 22:34:48,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:34:48,717 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 4589 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:48,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 1865 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:34:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-11-11 22:34:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 834. [2024-11-11 22:34:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 832 states have (on average 1.8653846153846154) internal successors, (1552), 833 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1552 transitions. [2024-11-11 22:34:48,732 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1552 transitions. Word has length 35 [2024-11-11 22:34:48,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:48,732 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1552 transitions. [2024-11-11 22:34:48,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1552 transitions. [2024-11-11 22:34:48,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 22:34:48,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:48,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:48,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:34:48,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:48,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:48,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1071361683, now seen corresponding path program 1 times [2024-11-11 22:34:48,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:48,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35912992] [2024-11-11 22:34:48,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:48,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:48,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35912992] [2024-11-11 22:34:48,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35912992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:48,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:48,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:48,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718396606] [2024-11-11 22:34:48,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:48,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:48,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:48,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:48,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:48,797 INFO L87 Difference]: Start difference. First operand 834 states and 1552 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:48,839 INFO L93 Difference]: Finished difference Result 939 states and 1715 transitions. [2024-11-11 22:34:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:48,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-11 22:34:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:48,843 INFO L225 Difference]: With dead ends: 939 [2024-11-11 22:34:48,843 INFO L226 Difference]: Without dead ends: 881 [2024-11-11 22:34:48,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:48,844 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 1466 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:48,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1548 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-11 22:34:48,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2024-11-11 22:34:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.847206385404789) internal successors, (1620), 878 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1620 transitions. [2024-11-11 22:34:48,865 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1620 transitions. Word has length 37 [2024-11-11 22:34:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:48,865 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1620 transitions. [2024-11-11 22:34:48,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1620 transitions. [2024-11-11 22:34:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 22:34:48,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:48,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:48,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:34:48,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:48,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1137855195, now seen corresponding path program 1 times [2024-11-11 22:34:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:48,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374377266] [2024-11-11 22:34:48,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:48,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:49,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:49,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374377266] [2024-11-11 22:34:49,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374377266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:49,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:49,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:49,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575080062] [2024-11-11 22:34:49,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:49,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:49,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:49,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:49,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:49,013 INFO L87 Difference]: Start difference. First operand 879 states and 1620 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:49,072 INFO L93 Difference]: Finished difference Result 984 states and 1780 transitions. [2024-11-11 22:34:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:49,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-11 22:34:49,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:49,075 INFO L225 Difference]: With dead ends: 984 [2024-11-11 22:34:49,076 INFO L226 Difference]: Without dead ends: 881 [2024-11-11 22:34:49,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:34:49,077 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 2946 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2946 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:49,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2946 Valid, 1589 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:49,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-11 22:34:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2024-11-11 22:34:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.8449258836944127) internal successors, (1618), 878 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1618 transitions. [2024-11-11 22:34:49,093 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1618 transitions. Word has length 37 [2024-11-11 22:34:49,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:49,093 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1618 transitions. [2024-11-11 22:34:49,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,093 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1618 transitions. [2024-11-11 22:34:49,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-11 22:34:49,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:49,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:49,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:34:49,095 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:49,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:49,095 INFO L85 PathProgramCache]: Analyzing trace with hash 499049456, now seen corresponding path program 1 times [2024-11-11 22:34:49,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:49,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247055778] [2024-11-11 22:34:49,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:49,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:49,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:49,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247055778] [2024-11-11 22:34:49,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247055778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:49,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:49,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:49,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980374795] [2024-11-11 22:34:49,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:49,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:49,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:49,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:49,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:49,236 INFO L87 Difference]: Start difference. First operand 879 states and 1618 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:49,285 INFO L93 Difference]: Finished difference Result 887 states and 1627 transitions. [2024-11-11 22:34:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:49,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-11-11 22:34:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:49,289 INFO L225 Difference]: With dead ends: 887 [2024-11-11 22:34:49,289 INFO L226 Difference]: Without dead ends: 885 [2024-11-11 22:34:49,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:49,290 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 0 mSDsluCounter, 4506 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6011 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:49,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6011 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:49,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-11 22:34:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2024-11-11 22:34:49,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.838052095130238) internal successors, (1623), 884 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1623 transitions. [2024-11-11 22:34:49,306 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1623 transitions. Word has length 38 [2024-11-11 22:34:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:49,306 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1623 transitions. [2024-11-11 22:34:49,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1623 transitions. [2024-11-11 22:34:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 22:34:49,307 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:49,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:49,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:34:49,307 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:49,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:49,308 INFO L85 PathProgramCache]: Analyzing trace with hash 166228827, now seen corresponding path program 1 times [2024-11-11 22:34:49,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:49,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923551047] [2024-11-11 22:34:49,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:49,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:49,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:49,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923551047] [2024-11-11 22:34:49,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923551047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:49,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:49,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:49,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410993728] [2024-11-11 22:34:49,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:49,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:49,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:49,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:49,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:49,356 INFO L87 Difference]: Start difference. First operand 885 states and 1623 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:49,381 INFO L93 Difference]: Finished difference Result 1007 states and 1804 transitions. [2024-11-11 22:34:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:49,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-11 22:34:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:49,384 INFO L225 Difference]: With dead ends: 1007 [2024-11-11 22:34:49,384 INFO L226 Difference]: Without dead ends: 943 [2024-11-11 22:34:49,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:49,387 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1476 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:49,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1588 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-11 22:34:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 941. [2024-11-11 22:34:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 939 states have (on average 1.8146964856230032) internal successors, (1704), 940 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1704 transitions. [2024-11-11 22:34:49,406 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1704 transitions. Word has length 39 [2024-11-11 22:34:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:49,407 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1704 transitions. [2024-11-11 22:34:49,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1704 transitions. [2024-11-11 22:34:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 22:34:49,408 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:49,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:49,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:34:49,409 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:49,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:49,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2049239973, now seen corresponding path program 1 times [2024-11-11 22:34:49,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:49,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075598510] [2024-11-11 22:34:49,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:49,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:49,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:49,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075598510] [2024-11-11 22:34:49,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075598510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:49,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:49,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:49,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441178773] [2024-11-11 22:34:49,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:49,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:49,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:49,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:49,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:49,454 INFO L87 Difference]: Start difference. First operand 941 states and 1704 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:49,479 INFO L93 Difference]: Finished difference Result 1243 states and 2144 transitions. [2024-11-11 22:34:49,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:49,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-11 22:34:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:49,483 INFO L225 Difference]: With dead ends: 1243 [2024-11-11 22:34:49,484 INFO L226 Difference]: Without dead ends: 1080 [2024-11-11 22:34:49,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:49,486 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:49,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-11-11 22:34:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1078. [2024-11-11 22:34:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1076 states have (on average 1.762081784386617) internal successors, (1896), 1077 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1896 transitions. [2024-11-11 22:34:49,507 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1896 transitions. Word has length 39 [2024-11-11 22:34:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:49,507 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1896 transitions. [2024-11-11 22:34:49,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1896 transitions. [2024-11-11 22:34:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 22:34:49,508 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:49,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:49,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:34:49,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:49,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:49,509 INFO L85 PathProgramCache]: Analyzing trace with hash -268307109, now seen corresponding path program 1 times [2024-11-11 22:34:49,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:49,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832241] [2024-11-11 22:34:49,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:49,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:49,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:49,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832241] [2024-11-11 22:34:49,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:49,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:49,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:49,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546892509] [2024-11-11 22:34:49,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:49,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:49,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:49,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:49,552 INFO L87 Difference]: Start difference. First operand 1078 states and 1896 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:49,576 INFO L93 Difference]: Finished difference Result 1630 states and 2678 transitions. [2024-11-11 22:34:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:49,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-11 22:34:49,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:49,580 INFO L225 Difference]: With dead ends: 1630 [2024-11-11 22:34:49,580 INFO L226 Difference]: Without dead ends: 1330 [2024-11-11 22:34:49,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:49,583 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1472 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:49,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1596 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:49,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2024-11-11 22:34:49,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2024-11-11 22:34:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1326 states have (on average 1.6832579185520362) internal successors, (2232), 1327 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2232 transitions. [2024-11-11 22:34:49,604 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2232 transitions. Word has length 39 [2024-11-11 22:34:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:49,605 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2232 transitions. [2024-11-11 22:34:49,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:49,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2232 transitions. [2024-11-11 22:34:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 22:34:49,605 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:49,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:49,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:34:49,605 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:49,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:49,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1521212245, now seen corresponding path program 1 times [2024-11-11 22:34:49,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:49,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105551040] [2024-11-11 22:34:49,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:49,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:49,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:49,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105551040] [2024-11-11 22:34:49,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105551040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:49,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:49,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:34:49,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28695016] [2024-11-11 22:34:49,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:49,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:49,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:49,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:49,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:49,709 INFO L87 Difference]: Start difference. First operand 1328 states and 2232 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:52,266 INFO L93 Difference]: Finished difference Result 2832 states and 5105 transitions. [2024-11-11 22:34:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:52,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-11 22:34:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:52,276 INFO L225 Difference]: With dead ends: 2832 [2024-11-11 22:34:52,276 INFO L226 Difference]: Without dead ends: 2079 [2024-11-11 22:34:52,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:52,277 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 836 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:52,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 146 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 22:34:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2024-11-11 22:34:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 2079. [2024-11-11 22:34:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2077 states have (on average 1.7366393837265286) internal successors, (3607), 2078 states have internal predecessors, (3607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 3607 transitions. [2024-11-11 22:34:52,317 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 3607 transitions. Word has length 48 [2024-11-11 22:34:52,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:52,317 INFO L471 AbstractCegarLoop]: Abstraction has 2079 states and 3607 transitions. [2024-11-11 22:34:52,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 3607 transitions. [2024-11-11 22:34:52,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 22:34:52,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:52,318 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:52,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:34:52,319 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:52,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:52,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1567417933, now seen corresponding path program 1 times [2024-11-11 22:34:52,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:52,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344653342] [2024-11-11 22:34:52,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:52,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:34:52,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:52,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344653342] [2024-11-11 22:34:52,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344653342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:52,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:52,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:52,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820899664] [2024-11-11 22:34:52,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:52,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:52,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:52,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:52,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:52,385 INFO L87 Difference]: Start difference. First operand 2079 states and 3607 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:52,453 INFO L93 Difference]: Finished difference Result 3711 states and 5883 transitions. [2024-11-11 22:34:52,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:52,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 54 [2024-11-11 22:34:52,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:52,462 INFO L225 Difference]: With dead ends: 3711 [2024-11-11 22:34:52,462 INFO L226 Difference]: Without dead ends: 3309 [2024-11-11 22:34:52,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:34:52,463 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3039 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:52,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3160 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2024-11-11 22:34:52,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 2555. [2024-11-11 22:34:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2553 states have (on average 1.6698002350176264) internal successors, (4263), 2554 states have internal predecessors, (4263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4263 transitions. [2024-11-11 22:34:52,503 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4263 transitions. Word has length 54 [2024-11-11 22:34:52,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:52,504 INFO L471 AbstractCegarLoop]: Abstraction has 2555 states and 4263 transitions. [2024-11-11 22:34:52,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4263 transitions. [2024-11-11 22:34:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 22:34:52,504 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:52,505 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:52,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:34:52,505 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:52,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash -648050867, now seen corresponding path program 1 times [2024-11-11 22:34:52,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:52,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302615284] [2024-11-11 22:34:52,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:52,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 22:34:52,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:52,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302615284] [2024-11-11 22:34:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302615284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:52,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:52,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:52,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967464789] [2024-11-11 22:34:52,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:52,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:52,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:52,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:52,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:52,592 INFO L87 Difference]: Start difference. First operand 2555 states and 4263 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:52,673 INFO L93 Difference]: Finished difference Result 4259 states and 6643 transitions. [2024-11-11 22:34:52,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:52,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 54 [2024-11-11 22:34:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:52,682 INFO L225 Difference]: With dead ends: 4259 [2024-11-11 22:34:52,682 INFO L226 Difference]: Without dead ends: 3709 [2024-11-11 22:34:52,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:34:52,683 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 3041 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:52,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:52,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2024-11-11 22:34:52,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3303. [2024-11-11 22:34:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 3301 states have (on average 1.6028476219327477) internal successors, (5291), 3302 states have internal predecessors, (5291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 5291 transitions. [2024-11-11 22:34:52,740 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 5291 transitions. Word has length 54 [2024-11-11 22:34:52,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:52,740 INFO L471 AbstractCegarLoop]: Abstraction has 3303 states and 5291 transitions. [2024-11-11 22:34:52,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 5291 transitions. [2024-11-11 22:34:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 22:34:52,741 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:52,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:52,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:34:52,742 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:52,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:52,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1132881997, now seen corresponding path program 1 times [2024-11-11 22:34:52,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:52,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5840906] [2024-11-11 22:34:52,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 22:34:52,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:52,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5840906] [2024-11-11 22:34:52,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5840906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:52,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:52,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:34:52,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079470380] [2024-11-11 22:34:52,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:52,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:34:52,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:52,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:34:52,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:34:52,818 INFO L87 Difference]: Start difference. First operand 3303 states and 5291 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:52,893 INFO L93 Difference]: Finished difference Result 4807 states and 7399 transitions. [2024-11-11 22:34:52,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:34:52,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 54 [2024-11-11 22:34:52,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:52,905 INFO L225 Difference]: With dead ends: 4807 [2024-11-11 22:34:52,905 INFO L226 Difference]: Without dead ends: 4257 [2024-11-11 22:34:52,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:34:52,907 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 3047 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:52,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3153 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2024-11-11 22:34:52,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 3851. [2024-11-11 22:34:52,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.5710574175110419) internal successors, (6047), 3850 states have internal predecessors, (6047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 6047 transitions. [2024-11-11 22:34:52,973 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 6047 transitions. Word has length 54 [2024-11-11 22:34:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:52,973 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 6047 transitions. [2024-11-11 22:34:52,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:52,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 6047 transitions. [2024-11-11 22:34:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 22:34:52,974 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:52,974 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:52,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:34:52,975 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:52,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:52,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1336470191, now seen corresponding path program 1 times [2024-11-11 22:34:52,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:52,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722481540] [2024-11-11 22:34:52,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:52,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:53,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:53,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722481540] [2024-11-11 22:34:53,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722481540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:53,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:53,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:53,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134422807] [2024-11-11 22:34:53,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:53,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:53,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:53,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:53,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:53,037 INFO L87 Difference]: Start difference. First operand 3851 states and 6047 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:53,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:53,080 INFO L93 Difference]: Finished difference Result 6175 states and 9257 transitions. [2024-11-11 22:34:53,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:53,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-11 22:34:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:53,096 INFO L225 Difference]: With dead ends: 6175 [2024-11-11 22:34:53,096 INFO L226 Difference]: Without dead ends: 3853 [2024-11-11 22:34:53,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:53,101 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 29 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:53,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:53,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2024-11-11 22:34:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2024-11-11 22:34:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.558067030397506) internal successors, (5997), 3850 states have internal predecessors, (5997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5997 transitions. [2024-11-11 22:34:53,171 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5997 transitions. Word has length 55 [2024-11-11 22:34:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:53,172 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 5997 transitions. [2024-11-11 22:34:53,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5997 transitions. [2024-11-11 22:34:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 22:34:53,173 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:53,173 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:53,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:34:53,173 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:53,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:53,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1355833083, now seen corresponding path program 1 times [2024-11-11 22:34:53,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:53,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129759162] [2024-11-11 22:34:53,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:53,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:53,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:53,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129759162] [2024-11-11 22:34:53,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129759162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:53,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:53,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139866113] [2024-11-11 22:34:53,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:53,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:53,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:53,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:53,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:53,222 INFO L87 Difference]: Start difference. First operand 3851 states and 5997 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:53,252 INFO L93 Difference]: Finished difference Result 4770 states and 7257 transitions. [2024-11-11 22:34:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:53,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-11 22:34:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:53,257 INFO L225 Difference]: With dead ends: 4770 [2024-11-11 22:34:53,257 INFO L226 Difference]: Without dead ends: 2448 [2024-11-11 22:34:53,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:53,259 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 23 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:53,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2024-11-11 22:34:53,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2440. [2024-11-11 22:34:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2438 states have (on average 1.6702214930270713) internal successors, (4072), 2439 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 4072 transitions. [2024-11-11 22:34:53,293 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 4072 transitions. Word has length 56 [2024-11-11 22:34:53,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:53,293 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 4072 transitions. [2024-11-11 22:34:53,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 4072 transitions. [2024-11-11 22:34:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 22:34:53,294 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:53,294 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:53,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:34:53,295 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:53,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:53,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1597882527, now seen corresponding path program 1 times [2024-11-11 22:34:53,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:53,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958579061] [2024-11-11 22:34:53,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:53,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:53,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:53,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958579061] [2024-11-11 22:34:53,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958579061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:34:53,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:34:53,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:34:53,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290087868] [2024-11-11 22:34:53,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:34:53,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:34:53,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:53,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:34:53,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:53,341 INFO L87 Difference]: Start difference. First operand 2440 states and 4072 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:53,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:53,362 INFO L93 Difference]: Finished difference Result 2894 states and 4686 transitions. [2024-11-11 22:34:53,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:34:53,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-11-11 22:34:53,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:53,366 INFO L225 Difference]: With dead ends: 2894 [2024-11-11 22:34:53,366 INFO L226 Difference]: Without dead ends: 1992 [2024-11-11 22:34:53,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:34:53,368 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 25 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:53,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2998 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:53,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2024-11-11 22:34:53,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1990. [2024-11-11 22:34:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1988 states have (on average 1.7359154929577465) internal successors, (3451), 1989 states have internal predecessors, (3451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 3451 transitions. [2024-11-11 22:34:53,391 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 3451 transitions. Word has length 57 [2024-11-11 22:34:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:53,391 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 3451 transitions. [2024-11-11 22:34:53,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 3451 transitions. [2024-11-11 22:34:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-11 22:34:53,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:53,392 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:53,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:34:53,392 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:53,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1649038701, now seen corresponding path program 1 times [2024-11-11 22:34:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:53,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667701862] [2024-11-11 22:34:53,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:53,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:34:53,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667701862] [2024-11-11 22:34:53,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667701862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:34:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593108634] [2024-11-11 22:34:53,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:53,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:34:53,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:53,513 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:34:53,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 22:34:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:53,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 22:34:53,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:34:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:34:53,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:34:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:34:53,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593108634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:34:53,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:34:53,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 10 [2024-11-11 22:34:53,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124035607] [2024-11-11 22:34:53,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:34:53,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:34:53,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:53,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:34:53,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:34:53,919 INFO L87 Difference]: Start difference. First operand 1990 states and 3451 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:53,986 INFO L93 Difference]: Finished difference Result 3052 states and 4845 transitions. [2024-11-11 22:34:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:34:53,987 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 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 59 [2024-11-11 22:34:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:53,991 INFO L225 Difference]: With dead ends: 3052 [2024-11-11 22:34:53,991 INFO L226 Difference]: Without dead ends: 2600 [2024-11-11 22:34:53,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:34:53,992 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 1499 mSDsluCounter, 4638 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 6154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:53,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 6154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:34:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2024-11-11 22:34:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2545. [2024-11-11 22:34:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2543 states have (on average 1.624852536374361) internal successors, (4132), 2544 states have internal predecessors, (4132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4132 transitions. [2024-11-11 22:34:54,023 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4132 transitions. Word has length 59 [2024-11-11 22:34:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:54,023 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 4132 transitions. [2024-11-11 22:34:54,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4132 transitions. [2024-11-11 22:34:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-11 22:34:54,024 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:54,024 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:54,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 22:34:54,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 22:34:54,225 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:54,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:54,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1651307681, now seen corresponding path program 1 times [2024-11-11 22:34:54,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:54,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540766043] [2024-11-11 22:34:54,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:54,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:55,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:55,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540766043] [2024-11-11 22:34:55,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540766043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:34:55,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999704061] [2024-11-11 22:34:55,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:55,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:34:55,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:55,029 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:34:55,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 22:34:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:55,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 22:34:55,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:34:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:55,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:34:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:56,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999704061] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:34:56,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:34:56,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2024-11-11 22:34:56,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713410859] [2024-11-11 22:34:56,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:34:56,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-11 22:34:56,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:56,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-11 22:34:56,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2024-11-11 22:34:56,044 INFO L87 Difference]: Start difference. First operand 2545 states and 4132 transitions. Second operand has 27 states, 27 states have (on average 5.407407407407407) internal successors, (146), 26 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:34:56,502 INFO L93 Difference]: Finished difference Result 4485 states and 6625 transitions. [2024-11-11 22:34:56,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:34:56,503 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.407407407407407) internal successors, (146), 26 states have internal predecessors, (146), 0 states have call successors, (0), 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 60 [2024-11-11 22:34:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:34:56,508 INFO L225 Difference]: With dead ends: 4485 [2024-11-11 22:34:56,508 INFO L226 Difference]: Without dead ends: 3576 [2024-11-11 22:34:56,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=319, Invalid=1087, Unknown=0, NotChecked=0, Total=1406 [2024-11-11 22:34:56,510 INFO L435 NwaCegarLoop]: 1491 mSDtfsCounter, 16514 mSDsluCounter, 3165 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16514 SdHoareTripleChecker+Valid, 4656 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:34:56,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16514 Valid, 4656 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:34:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3576 states. [2024-11-11 22:34:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3576 to 3538. [2024-11-11 22:34:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3538 states, 3536 states have (on average 1.5158371040723981) internal successors, (5360), 3537 states have internal predecessors, (5360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3538 states to 3538 states and 5360 transitions. [2024-11-11 22:34:56,560 INFO L78 Accepts]: Start accepts. Automaton has 3538 states and 5360 transitions. Word has length 60 [2024-11-11 22:34:56,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:34:56,560 INFO L471 AbstractCegarLoop]: Abstraction has 3538 states and 5360 transitions. [2024-11-11 22:34:56,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.407407407407407) internal successors, (146), 26 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:34:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3538 states and 5360 transitions. [2024-11-11 22:34:56,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-11 22:34:56,561 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:34:56,561 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:34:56,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 22:34:56,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 22:34:56,766 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:34:56,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:34:56,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1955522029, now seen corresponding path program 1 times [2024-11-11 22:34:56,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:34:56,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42055096] [2024-11-11 22:34:56,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:56,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:34:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:57,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:34:57,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42055096] [2024-11-11 22:34:57,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42055096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:34:57,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111827464] [2024-11-11 22:34:57,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:34:57,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:34:57,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:34:57,032 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:34:57,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 22:34:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:34:57,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-11 22:34:57,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:34:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:58,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:34:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:34:59,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111827464] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:34:59,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:34:59,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 37 [2024-11-11 22:34:59,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216600107] [2024-11-11 22:34:59,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:34:59,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-11 22:34:59,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:34:59,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-11 22:34:59,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1183, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 22:34:59,330 INFO L87 Difference]: Start difference. First operand 3538 states and 5360 transitions. Second operand has 37 states, 37 states have (on average 4.27027027027027) internal successors, (158), 37 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:35:14,670 INFO L93 Difference]: Finished difference Result 12879 states and 17237 transitions. [2024-11-11 22:35:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2024-11-11 22:35:14,671 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.27027027027027) internal successors, (158), 37 states have internal predecessors, (158), 0 states have call successors, (0), 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 60 [2024-11-11 22:35:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:35:14,685 INFO L225 Difference]: With dead ends: 12879 [2024-11-11 22:35:14,685 INFO L226 Difference]: Without dead ends: 11031 [2024-11-11 22:35:14,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12082 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=5773, Invalid=25733, Unknown=0, NotChecked=0, Total=31506 [2024-11-11 22:35:14,694 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 12933 mSDsluCounter, 19349 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12933 SdHoareTripleChecker+Valid, 20896 SdHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:35:14,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12933 Valid, 20896 Invalid, 2089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:35:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11031 states. [2024-11-11 22:35:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11031 to 8275. [2024-11-11 22:35:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8275 states, 8273 states have (on average 1.3619001571376768) internal successors, (11267), 8274 states have internal predecessors, (11267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8275 states to 8275 states and 11267 transitions. [2024-11-11 22:35:14,871 INFO L78 Accepts]: Start accepts. Automaton has 8275 states and 11267 transitions. Word has length 60 [2024-11-11 22:35:14,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:35:14,871 INFO L471 AbstractCegarLoop]: Abstraction has 8275 states and 11267 transitions. [2024-11-11 22:35:14,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.27027027027027) internal successors, (158), 37 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 8275 states and 11267 transitions. [2024-11-11 22:35:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-11 22:35:14,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:35:14,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:35:14,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 22:35:15,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:15,073 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:35:15,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:35:15,073 INFO L85 PathProgramCache]: Analyzing trace with hash -909285249, now seen corresponding path program 1 times [2024-11-11 22:35:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:35:15,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706816500] [2024-11-11 22:35:15,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:15,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:35:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:15,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:35:15,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706816500] [2024-11-11 22:35:15,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706816500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:35:15,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226155804] [2024-11-11 22:35:15,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:15,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:15,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:35:15,350 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:35:15,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 22:35:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:15,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 22:35:15,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:35:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:15,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:35:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:16,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226155804] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:35:16,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:35:16,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-11 22:35:16,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549680187] [2024-11-11 22:35:16,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:35:16,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-11 22:35:16,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:16,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-11 22:35:16,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2024-11-11 22:35:16,054 INFO L87 Difference]: Start difference. First operand 8275 states and 11267 transitions. Second operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:16,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:35:16,461 INFO L93 Difference]: Finished difference Result 15813 states and 20761 transitions. [2024-11-11 22:35:16,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 22:35:16,461 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 0 states have call successors, (0), 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 61 [2024-11-11 22:35:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:35:16,474 INFO L225 Difference]: With dead ends: 15813 [2024-11-11 22:35:16,474 INFO L226 Difference]: Without dead ends: 9671 [2024-11-11 22:35:16,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2024-11-11 22:35:16,481 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 17913 mSDsluCounter, 4559 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17913 SdHoareTripleChecker+Valid, 6056 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:35:16,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17913 Valid, 6056 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:35:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9671 states. [2024-11-11 22:35:16,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9671 to 9623. [2024-11-11 22:35:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9623 states, 9621 states have (on average 1.3376987839101964) internal successors, (12870), 9622 states have internal predecessors, (12870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9623 states to 9623 states and 12870 transitions. [2024-11-11 22:35:16,673 INFO L78 Accepts]: Start accepts. Automaton has 9623 states and 12870 transitions. Word has length 61 [2024-11-11 22:35:16,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:35:16,674 INFO L471 AbstractCegarLoop]: Abstraction has 9623 states and 12870 transitions. [2024-11-11 22:35:16,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 9623 states and 12870 transitions. [2024-11-11 22:35:16,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 22:35:16,675 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:35:16,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:35:16,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 22:35:16,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:16,876 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:35:16,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:35:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash 705601745, now seen corresponding path program 1 times [2024-11-11 22:35:16,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:35:16,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122377778] [2024-11-11 22:35:16,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:16,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:35:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:17,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:35:17,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122377778] [2024-11-11 22:35:17,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122377778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:35:17,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009990304] [2024-11-11 22:35:17,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:17,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:17,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:35:17,779 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:35:17,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 22:35:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:17,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 22:35:17,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:35:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:18,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:35:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:19,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009990304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:35:19,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:35:19,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 12] total 41 [2024-11-11 22:35:19,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757526538] [2024-11-11 22:35:19,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:35:19,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-11 22:35:19,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:19,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-11 22:35:19,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1514, Unknown=0, NotChecked=0, Total=1640 [2024-11-11 22:35:19,181 INFO L87 Difference]: Start difference. First operand 9623 states and 12870 transitions. Second operand has 41 states, 41 states have (on average 3.8048780487804876) internal successors, (156), 41 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:35:25,637 INFO L93 Difference]: Finished difference Result 13553 states and 17793 transitions. [2024-11-11 22:35:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-11 22:35:25,637 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.8048780487804876) internal successors, (156), 41 states have internal predecessors, (156), 0 states have call successors, (0), 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 62 [2024-11-11 22:35:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:35:25,649 INFO L225 Difference]: With dead ends: 13553 [2024-11-11 22:35:25,649 INFO L226 Difference]: Without dead ends: 9767 [2024-11-11 22:35:25,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2486 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2423, Invalid=8919, Unknown=0, NotChecked=0, Total=11342 [2024-11-11 22:35:25,657 INFO L435 NwaCegarLoop]: 1571 mSDtfsCounter, 17704 mSDsluCounter, 22468 mSDsCounter, 0 mSdLazyCounter, 2086 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17704 SdHoareTripleChecker+Valid, 24039 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:35:25,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17704 Valid, 24039 Invalid, 2158 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 2086 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:35:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2024-11-11 22:35:25,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 8191. [2024-11-11 22:35:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8191 states, 8189 states have (on average 1.3524239833923557) internal successors, (11075), 8190 states have internal predecessors, (11075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8191 states to 8191 states and 11075 transitions. [2024-11-11 22:35:25,902 INFO L78 Accepts]: Start accepts. Automaton has 8191 states and 11075 transitions. Word has length 62 [2024-11-11 22:35:25,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:35:25,902 INFO L471 AbstractCegarLoop]: Abstraction has 8191 states and 11075 transitions. [2024-11-11 22:35:25,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.8048780487804876) internal successors, (156), 41 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 8191 states and 11075 transitions. [2024-11-11 22:35:25,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 22:35:25,904 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:35:25,904 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:35:25,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 22:35:26,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:26,109 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:35:26,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:35:26,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1645833661, now seen corresponding path program 1 times [2024-11-11 22:35:26,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:35:26,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676251423] [2024-11-11 22:35:26,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:26,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:35:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:26,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:35:26,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676251423] [2024-11-11 22:35:26,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676251423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:35:26,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573088456] [2024-11-11 22:35:26,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:26,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:26,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:35:26,622 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:35:26,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 22:35:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:26,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-11 22:35:26,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:35:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:27,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:35:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:28,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573088456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:35:28,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:35:28,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-11-11 22:35:28,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348169376] [2024-11-11 22:35:28,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:35:28,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-11 22:35:28,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:28,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-11 22:35:28,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2024-11-11 22:35:28,359 INFO L87 Difference]: Start difference. First operand 8191 states and 11075 transitions. Second operand has 27 states, 27 states have (on average 7.962962962962963) internal successors, (215), 26 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:28,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:35:28,897 INFO L93 Difference]: Finished difference Result 11773 states and 15586 transitions. [2024-11-11 22:35:28,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:35:28,897 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.962962962962963) internal successors, (215), 26 states have internal predecessors, (215), 0 states have call successors, (0), 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 99 [2024-11-11 22:35:28,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:35:28,904 INFO L225 Difference]: With dead ends: 11773 [2024-11-11 22:35:28,905 INFO L226 Difference]: Without dead ends: 8391 [2024-11-11 22:35:28,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=343, Invalid=1217, Unknown=0, NotChecked=0, Total=1560 [2024-11-11 22:35:28,908 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 17936 mSDsluCounter, 9136 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17936 SdHoareTripleChecker+Valid, 10646 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:35:28,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17936 Valid, 10646 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:35:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2024-11-11 22:35:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 7065. [2024-11-11 22:35:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7065 states, 7063 states have (on average 1.3614611354948323) internal successors, (9616), 7064 states have internal predecessors, (9616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7065 states to 7065 states and 9616 transitions. [2024-11-11 22:35:29,096 INFO L78 Accepts]: Start accepts. Automaton has 7065 states and 9616 transitions. Word has length 99 [2024-11-11 22:35:29,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:35:29,096 INFO L471 AbstractCegarLoop]: Abstraction has 7065 states and 9616 transitions. [2024-11-11 22:35:29,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.962962962962963) internal successors, (215), 26 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand 7065 states and 9616 transitions. [2024-11-11 22:35:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 22:35:29,100 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:35:29,100 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:35:29,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 22:35:29,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:29,301 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:35:29,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:35:29,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1960996049, now seen corresponding path program 1 times [2024-11-11 22:35:29,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:35:29,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264774511] [2024-11-11 22:35:29,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:29,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:35:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 34 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:29,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:35:29,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264774511] [2024-11-11 22:35:29,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264774511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:35:29,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325407658] [2024-11-11 22:35:29,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:29,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:29,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:35:29,943 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:35:29,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 22:35:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:30,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-11 22:35:30,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:35:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:30,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:35:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 34 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:31,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325407658] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:35:31,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:35:31,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2024-11-11 22:35:31,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589202375] [2024-11-11 22:35:31,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:35:31,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-11 22:35:31,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:31,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-11 22:35:31,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2024-11-11 22:35:31,497 INFO L87 Difference]: Start difference. First operand 7065 states and 9616 transitions. Second operand has 31 states, 31 states have (on average 7.451612903225806) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:32,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:35:32,677 INFO L93 Difference]: Finished difference Result 10023 states and 13268 transitions. [2024-11-11 22:35:32,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-11 22:35:32,677 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.451612903225806) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 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 99 [2024-11-11 22:35:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:35:32,684 INFO L225 Difference]: With dead ends: 10023 [2024-11-11 22:35:32,684 INFO L226 Difference]: Without dead ends: 7151 [2024-11-11 22:35:32,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=669, Invalid=2411, Unknown=0, NotChecked=0, Total=3080 [2024-11-11 22:35:32,687 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 14935 mSDsluCounter, 13915 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14935 SdHoareTripleChecker+Valid, 15452 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:35:32,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14935 Valid, 15452 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:35:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7151 states. [2024-11-11 22:35:32,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7151 to 7065. [2024-11-11 22:35:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7065 states, 7063 states have (on average 1.3553730709330314) internal successors, (9573), 7064 states have internal predecessors, (9573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7065 states to 7065 states and 9573 transitions. [2024-11-11 22:35:32,881 INFO L78 Accepts]: Start accepts. Automaton has 7065 states and 9573 transitions. Word has length 99 [2024-11-11 22:35:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:35:32,881 INFO L471 AbstractCegarLoop]: Abstraction has 7065 states and 9573 transitions. [2024-11-11 22:35:32,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.451612903225806) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 7065 states and 9573 transitions. [2024-11-11 22:35:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 22:35:32,883 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:35:32,883 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:35:32,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 22:35:33,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:33,084 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:35:33,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:35:33,084 INFO L85 PathProgramCache]: Analyzing trace with hash 852864303, now seen corresponding path program 1 times [2024-11-11 22:35:33,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:35:33,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821271709] [2024-11-11 22:35:33,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:33,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:35:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 24 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:33,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:35:33,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821271709] [2024-11-11 22:35:33,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821271709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:35:33,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321019613] [2024-11-11 22:35:33,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:33,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:33,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:35:33,681 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:35:33,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 22:35:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:33,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-11 22:35:33,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:35:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 18 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:34,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:35:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:35,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321019613] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:35:35,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:35:35,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 11] total 40 [2024-11-11 22:35:35,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764875318] [2024-11-11 22:35:35,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:35:35,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-11 22:35:35,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:35,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-11 22:35:35,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1488, Unknown=0, NotChecked=0, Total=1640 [2024-11-11 22:35:35,467 INFO L87 Difference]: Start difference. First operand 7065 states and 9573 transitions. Second operand has 41 states, 41 states have (on average 6.902439024390244) internal successors, (283), 40 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:35:38,712 INFO L93 Difference]: Finished difference Result 12051 states and 15798 transitions. [2024-11-11 22:35:38,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-11 22:35:38,712 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.902439024390244) internal successors, (283), 40 states have internal predecessors, (283), 0 states have call successors, (0), 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 99 [2024-11-11 22:35:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:35:38,720 INFO L225 Difference]: With dead ends: 12051 [2024-11-11 22:35:38,720 INFO L226 Difference]: Without dead ends: 9795 [2024-11-11 22:35:38,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2534 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1910, Invalid=8596, Unknown=0, NotChecked=0, Total=10506 [2024-11-11 22:35:38,724 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 17483 mSDsluCounter, 26217 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17483 SdHoareTripleChecker+Valid, 27771 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:35:38,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17483 Valid, 27771 Invalid, 2121 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [75 Valid, 2046 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:35:38,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9795 states. [2024-11-11 22:35:38,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9795 to 8169. [2024-11-11 22:35:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8169 states, 8167 states have (on average 1.3276600955063058) internal successors, (10843), 8168 states have internal predecessors, (10843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8169 states to 8169 states and 10843 transitions. [2024-11-11 22:35:38,986 INFO L78 Accepts]: Start accepts. Automaton has 8169 states and 10843 transitions. Word has length 99 [2024-11-11 22:35:38,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:35:38,986 INFO L471 AbstractCegarLoop]: Abstraction has 8169 states and 10843 transitions. [2024-11-11 22:35:38,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.902439024390244) internal successors, (283), 40 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:35:38,987 INFO L276 IsEmpty]: Start isEmpty. Operand 8169 states and 10843 transitions. [2024-11-11 22:35:38,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 22:35:38,988 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:35:38,988 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:35:39,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-11 22:35:39,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-11 22:35:39,189 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:35:39,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:35:39,190 INFO L85 PathProgramCache]: Analyzing trace with hash -99841195, now seen corresponding path program 1 times [2024-11-11 22:35:39,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:35:39,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439252348] [2024-11-11 22:35:39,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:39,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:35:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:40,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:35:40,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439252348] [2024-11-11 22:35:40,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439252348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:35:40,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697016128] [2024-11-11 22:35:40,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:35:40,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:35:40,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:35:40,328 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:35:40,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 22:35:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:35:40,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-11 22:35:40,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:35:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 55 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-11 22:35:42,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:35:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:35:47,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697016128] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:35:47,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:35:47,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 29] total 71 [2024-11-11 22:35:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402416457] [2024-11-11 22:35:47,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:35:47,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-11 22:35:47,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:35:47,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-11 22:35:47,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=4484, Unknown=0, NotChecked=0, Total=4970 [2024-11-11 22:35:47,562 INFO L87 Difference]: Start difference. First operand 8169 states and 10843 transitions. Second operand has 71 states, 71 states have (on average 3.788732394366197) internal successors, (269), 71 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)