./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.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.7.ufo.UNBOUNDED.pals+Problem12_label00.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 958778a599a0592241cec2803e04add83a2302d606be24f73b4e8727645b338d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:48:58,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:48:58,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:48:58,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:48:58,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:48:58,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:48:58,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:48:58,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:48:58,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:48:58,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:48:58,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:48:58,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:48:58,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:48:58,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:48:58,320 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:48:58,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:48:58,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:48:58,321 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:48:58,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:48:58,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:48:58,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:48:58,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:48:58,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:48:58,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:48:58,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:48:58,325 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:48:58,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:48:58,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:48:58,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:48:58,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:48:58,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:48:58,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:48:58,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:48:58,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:48:58,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:48:58,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:48:58,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:48:58,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:48:58,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:48:58,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:48:58,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:48:58,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:48:58,328 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 -> 958778a599a0592241cec2803e04add83a2302d606be24f73b4e8727645b338d [2024-11-11 22:48:58,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:48:58,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:48:58,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:48:58,564 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:48:58,564 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:48:58,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c [2024-11-11 22:48:59,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:49:00,081 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:49:00,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c [2024-11-11 22:49:00,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d69e698e0/6f56bf70b6ce42b3a154d3c2978a4953/FLAGd8734eb6a [2024-11-11 22:49:00,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d69e698e0/6f56bf70b6ce42b3a154d3c2978a4953 [2024-11-11 22:49:00,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:49:00,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:49:00,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:49:00,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:49:00,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:49:00,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:49:00" (1/1) ... [2024-11-11 22:49:00,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2f1ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:49:00, skipping insertion in model container [2024-11-11 22:49:00,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:49:00" (1/1) ... [2024-11-11 22:49:00,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:49:00,657 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.7.ufo.UNBOUNDED.pals+Problem12_label00.c[20454,20467] [2024-11-11 22:49:00,684 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.7.ufo.UNBOUNDED.pals+Problem12_label00.c[22329,22342] [2024-11-11 22:49:01,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:49:01,230 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:49:01,266 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.7.ufo.UNBOUNDED.pals+Problem12_label00.c[20454,20467] [2024-11-11 22:49:01,269 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.7.ufo.UNBOUNDED.pals+Problem12_label00.c[22329,22342] [2024-11-11 22:49:01,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:49:01,584 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:49:01,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:49:01 WrapperNode [2024-11-11 22:49:01,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:49:01,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:49:01,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:49:01,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:49:01,591 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:49:01" (1/1) ... [2024-11-11 22:49:01,624 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:49:01" (1/1) ... [2024-11-11 22:49:01,857 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5219 [2024-11-11 22:49:01,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:49:01,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:49:01,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:49:01,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:49:01,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:49:01" (1/1) ... [2024-11-11 22:49:01,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:49:01" (1/1) ... [2024-11-11 22:49:01,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:49:01" (1/1) ... [2024-11-11 22:49:02,081 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:49:02,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:49:01" (1/1) ... [2024-11-11 22:49:02,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:49:01" (1/1) ... [2024-11-11 22:49:02,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:49:01" (1/1) ... [2024-11-11 22:49:02,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:49:01" (1/1) ... [2024-11-11 22:49:02,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:49:01" (1/1) ... [2024-11-11 22:49:02,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:49:01" (1/1) ... [2024-11-11 22:49:02,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:49:02,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:49:02,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:49:02,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:49:02,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:49:01" (1/1) ... [2024-11-11 22:49:02,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:49:02,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:49:02,319 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:49:02,321 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:49:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:49:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:49:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:49:02,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:49:02,433 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:49:02,435 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:49:05,642 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-11-11 22:49:05,643 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:49:05,673 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:49:05,674 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 22:49:05,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:49:05 BoogieIcfgContainer [2024-11-11 22:49:05,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:49:05,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:49:05,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:49:05,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:49:05,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:49:00" (1/3) ... [2024-11-11 22:49:05,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df57e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:49:05, skipping insertion in model container [2024-11-11 22:49:05,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:49:01" (2/3) ... [2024-11-11 22:49:05,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df57e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:49:05, skipping insertion in model container [2024-11-11 22:49:05,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:49:05" (3/3) ... [2024-11-11 22:49:05,684 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label00.c [2024-11-11 22:49:05,703 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:49:05,703 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:49:05,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:49:05,801 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;@747b1241, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:49:05,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:49:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 932 states, 929 states have (on average 1.9031216361679224) internal successors, (1768), 931 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states 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:49:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 22:49:05,818 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:05,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:49:05,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:05,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:05,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1691146357, now seen corresponding path program 1 times [2024-11-11 22:49:05,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:05,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005825982] [2024-11-11 22:49:05,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:05,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:06,048 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:49:06,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005825982] [2024-11-11 22:49:06,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005825982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:06,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:06,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:49:06,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495589847] [2024-11-11 22:49:06,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:06,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:49:06,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:06,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:49:06,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:49:06,079 INFO L87 Difference]: Start difference. First operand has 932 states, 929 states have (on average 1.9031216361679224) internal successors, (1768), 931 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:49:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:08,862 INFO L93 Difference]: Finished difference Result 2561 states and 4928 transitions. [2024-11-11 22:49:08,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:49:08,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-11 22:49:08,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:08,882 INFO L225 Difference]: With dead ends: 2561 [2024-11-11 22:49:08,883 INFO L226 Difference]: Without dead ends: 1617 [2024-11-11 22:49:08,889 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:49:08,893 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 1015 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:49:08,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 679 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 22:49:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2024-11-11 22:49:08,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2024-11-11 22:49:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1615 states have (on average 1.648297213622291) internal successors, (2662), 1616 states have internal predecessors, (2662), 0 states have call successors, (0), 0 states 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:49:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2662 transitions. [2024-11-11 22:49:08,967 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2662 transitions. Word has length 16 [2024-11-11 22:49:08,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:08,967 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2662 transitions. [2024-11-11 22:49:08,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:49:08,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2662 transitions. [2024-11-11 22:49:08,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 22:49:08,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:08,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:49:08,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:49:08,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:08,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:08,970 INFO L85 PathProgramCache]: Analyzing trace with hash 189926458, now seen corresponding path program 1 times [2024-11-11 22:49:08,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:08,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369667974] [2024-11-11 22:49:08,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:08,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:09,142 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:49:09,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:09,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369667974] [2024-11-11 22:49:09,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369667974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:09,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:09,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:49:09,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466259324] [2024-11-11 22:49:09,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:09,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:49:09,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:09,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:49:09,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:49:09,146 INFO L87 Difference]: Start difference. First operand 1617 states and 2662 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:49:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:09,210 INFO L93 Difference]: Finished difference Result 1677 states and 2756 transitions. [2024-11-11 22:49:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:49:09,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-11 22:49:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:09,215 INFO L225 Difference]: With dead ends: 1677 [2024-11-11 22:49:09,216 INFO L226 Difference]: Without dead ends: 1617 [2024-11-11 22:49:09,216 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:49:09,217 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 0 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6477 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:49:09,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6477 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:49:09,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2024-11-11 22:49:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2024-11-11 22:49:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1615 states have (on average 1.6173374613003095) internal successors, (2612), 1616 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states 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:49:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2612 transitions. [2024-11-11 22:49:09,240 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2612 transitions. Word has length 28 [2024-11-11 22:49:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:09,240 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2612 transitions. [2024-11-11 22:49:09,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:49:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2612 transitions. [2024-11-11 22:49:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 22:49:09,242 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:09,242 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, 1, 1, 1, 1, 1, 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:49:09,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:49:09,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:09,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:09,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1109970983, now seen corresponding path program 1 times [2024-11-11 22:49:09,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:09,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571291179] [2024-11-11 22:49:09,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:09,462 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:49:09,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:09,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571291179] [2024-11-11 22:49:09,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571291179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:09,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:09,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:49:09,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341127194] [2024-11-11 22:49:09,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:09,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:49:09,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:09,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:49:09,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:49:09,464 INFO L87 Difference]: Start difference. First operand 1617 states and 2612 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:49:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:09,803 INFO L93 Difference]: Finished difference Result 2401 states and 3872 transitions. [2024-11-11 22:49:09,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:49:09,803 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-11 22:49:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:09,812 INFO L225 Difference]: With dead ends: 2401 [2024-11-11 22:49:09,813 INFO L226 Difference]: Without dead ends: 2345 [2024-11-11 22:49:09,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-11-11 22:49:09,817 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 11614 mSDsluCounter, 2746 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11614 SdHoareTripleChecker+Valid, 4325 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:49:09,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11614 Valid, 4325 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:49:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2024-11-11 22:49:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1671. [2024-11-11 22:49:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1669 states have (on average 1.6171360095865788) internal successors, (2699), 1670 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states 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:49:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2699 transitions. [2024-11-11 22:49:09,849 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2699 transitions. Word has length 77 [2024-11-11 22:49:09,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:09,850 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2699 transitions. [2024-11-11 22:49:09,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:49:09,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2699 transitions. [2024-11-11 22:49:09,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:49:09,851 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:09,851 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, 1, 1, 1, 1, 1, 1, 1, 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:49:09,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:49:09,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:09,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:09,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1349050793, now seen corresponding path program 1 times [2024-11-11 22:49:09,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:09,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768329980] [2024-11-11 22:49:09,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:09,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:09,987 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:49:09,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:09,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768329980] [2024-11-11 22:49:09,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768329980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:09,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:09,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:49:09,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317124605] [2024-11-11 22:49:09,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:09,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:49:09,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:09,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:49:09,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:49:09,989 INFO L87 Difference]: Start difference. First operand 1671 states and 2699 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:49:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:10,046 INFO L93 Difference]: Finished difference Result 1880 states and 3034 transitions. [2024-11-11 22:49:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:49:10,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-11 22:49:10,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:10,054 INFO L225 Difference]: With dead ends: 1880 [2024-11-11 22:49:10,054 INFO L226 Difference]: Without dead ends: 1770 [2024-11-11 22:49:10,055 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:49:10,055 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1500 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:49:10,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1664 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:49:10,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2024-11-11 22:49:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1766. [2024-11-11 22:49:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.6150793650793651) internal successors, (2849), 1765 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states 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:49:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2849 transitions. [2024-11-11 22:49:10,087 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2849 transitions. Word has length 79 [2024-11-11 22:49:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:10,088 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2849 transitions. [2024-11-11 22:49:10,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:49:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2849 transitions. [2024-11-11 22:49:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:49:10,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:10,090 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, 1, 1, 1, 1, 1, 1, 1, 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:49:10,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:49:10,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:10,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:10,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1415544305, now seen corresponding path program 1 times [2024-11-11 22:49:10,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:10,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460341103] [2024-11-11 22:49:10,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:10,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:10,461 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:49:10,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:10,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460341103] [2024-11-11 22:49:10,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460341103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:10,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:10,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:49:10,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176117247] [2024-11-11 22:49:10,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:10,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:49:10,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:10,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:49:10,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:49:10,464 INFO L87 Difference]: Start difference. First operand 1766 states and 2849 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:49:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:10,728 INFO L93 Difference]: Finished difference Result 1973 states and 3177 transitions. [2024-11-11 22:49:10,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:49:10,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-11 22:49:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:10,735 INFO L225 Difference]: With dead ends: 1973 [2024-11-11 22:49:10,735 INFO L226 Difference]: Without dead ends: 1768 [2024-11-11 22:49:10,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-11 22:49:10,738 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 6068 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6068 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:49:10,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6068 Valid, 2102 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:49:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2024-11-11 22:49:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1766. [2024-11-11 22:49:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.6139455782312926) internal successors, (2847), 1765 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states 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:49:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2847 transitions. [2024-11-11 22:49:10,767 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2847 transitions. Word has length 79 [2024-11-11 22:49:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:10,768 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2847 transitions. [2024-11-11 22:49:10,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:49:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2847 transitions. [2024-11-11 22:49:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 22:49:10,769 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:10,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:10,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:49:10,769 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:10,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:10,770 INFO L85 PathProgramCache]: Analyzing trace with hash 517477589, now seen corresponding path program 1 times [2024-11-11 22:49:10,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:10,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338342137] [2024-11-11 22:49:10,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:10,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:10,997 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:49:10,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:10,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338342137] [2024-11-11 22:49:10,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338342137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:10,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:10,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:49:10,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755175367] [2024-11-11 22:49:10,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:11,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:49:11,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:11,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:49:11,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:49:11,001 INFO L87 Difference]: Start difference. First operand 1766 states and 2847 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:49:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:11,056 INFO L93 Difference]: Finished difference Result 1774 states and 2856 transitions. [2024-11-11 22:49:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 22:49:11,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-11 22:49:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:11,065 INFO L225 Difference]: With dead ends: 1774 [2024-11-11 22:49:11,065 INFO L226 Difference]: Without dead ends: 1772 [2024-11-11 22:49:11,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:49:11,067 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 0 mSDsluCounter, 9461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11040 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:49:11,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11040 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:49:11,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2024-11-11 22:49:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1772. [2024-11-11 22:49:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1770 states have (on average 1.6112994350282486) internal successors, (2852), 1771 states have internal predecessors, (2852), 0 states have call successors, (0), 0 states 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:49:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2852 transitions. [2024-11-11 22:49:11,098 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2852 transitions. Word has length 80 [2024-11-11 22:49:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:11,099 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2852 transitions. [2024-11-11 22:49:11,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:49:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2852 transitions. [2024-11-11 22:49:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:49:11,101 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:11,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:49:11,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:11,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:11,102 INFO L85 PathProgramCache]: Analyzing trace with hash -927531695, now seen corresponding path program 1 times [2024-11-11 22:49:11,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:11,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508686738] [2024-11-11 22:49:11,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:11,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:11,152 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:49:11,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:11,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508686738] [2024-11-11 22:49:11,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508686738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:11,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:11,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:49:11,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335065265] [2024-11-11 22:49:11,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:11,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:49:11,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:11,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:49:11,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:49:11,154 INFO L87 Difference]: Start difference. First operand 1772 states and 2852 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:49:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:11,178 INFO L93 Difference]: Finished difference Result 2178 states and 3484 transitions. [2024-11-11 22:49:11,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:49:11,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 22:49:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:11,184 INFO L225 Difference]: With dead ends: 2178 [2024-11-11 22:49:11,185 INFO L226 Difference]: Without dead ends: 1967 [2024-11-11 22:49:11,185 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:49:11,186 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 1517 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1747 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:49:11,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1747 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:49:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2024-11-11 22:49:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1965. [2024-11-11 22:49:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1963 states have (on average 1.6041772796739684) internal successors, (3149), 1964 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states 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:49:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 3149 transitions. [2024-11-11 22:49:11,216 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 3149 transitions. Word has length 81 [2024-11-11 22:49:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:11,217 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 3149 transitions. [2024-11-11 22:49:11,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:49:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 3149 transitions. [2024-11-11 22:49:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:49:11,218 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:11,218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:49:11,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:11,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash -764617135, now seen corresponding path program 1 times [2024-11-11 22:49:11,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:11,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616131167] [2024-11-11 22:49:11,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:11,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:11,266 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:49:11,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:11,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616131167] [2024-11-11 22:49:11,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616131167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:11,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:11,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:49:11,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405457263] [2024-11-11 22:49:11,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:11,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:49:11,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:11,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:49:11,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:49:11,268 INFO L87 Difference]: Start difference. First operand 1965 states and 3149 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:49:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:11,306 INFO L93 Difference]: Finished difference Result 2741 states and 4347 transitions. [2024-11-11 22:49:11,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:49:11,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 22:49:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:11,313 INFO L225 Difference]: With dead ends: 2741 [2024-11-11 22:49:11,313 INFO L226 Difference]: Without dead ends: 2337 [2024-11-11 22:49:11,314 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:49:11,315 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1515 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1749 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:49:11,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1749 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:49:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2024-11-11 22:49:11,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2335. [2024-11-11 22:49:11,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2333 states have (on average 1.5906558079725674) internal successors, (3711), 2334 states have internal predecessors, (3711), 0 states have call successors, (0), 0 states 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:49:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3711 transitions. [2024-11-11 22:49:11,355 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3711 transitions. Word has length 81 [2024-11-11 22:49:11,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:11,356 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3711 transitions. [2024-11-11 22:49:11,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:49:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3711 transitions. [2024-11-11 22:49:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:49:11,358 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:11,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:49:11,359 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:11,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:11,359 INFO L85 PathProgramCache]: Analyzing trace with hash 737501265, now seen corresponding path program 1 times [2024-11-11 22:49:11,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:11,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511273477] [2024-11-11 22:49:11,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:11,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:11,414 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:49:11,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:11,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511273477] [2024-11-11 22:49:11,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511273477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:11,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:11,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:49:11,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918084082] [2024-11-11 22:49:11,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:11,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:49:11,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:11,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:49:11,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:49:11,416 INFO L87 Difference]: Start difference. First operand 2335 states and 3711 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:49:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:11,491 INFO L93 Difference]: Finished difference Result 3819 states and 5977 transitions. [2024-11-11 22:49:11,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:49:11,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 22:49:11,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:11,500 INFO L225 Difference]: With dead ends: 3819 [2024-11-11 22:49:11,500 INFO L226 Difference]: Without dead ends: 3045 [2024-11-11 22:49:11,501 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:49:11,502 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 1511 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1745 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:49:11,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 1745 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:49:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2024-11-11 22:49:11,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 3043. [2024-11-11 22:49:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3043 states, 3041 states have (on average 1.568891811903979) internal successors, (4771), 3042 states have internal predecessors, (4771), 0 states have call successors, (0), 0 states 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:49:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4771 transitions. [2024-11-11 22:49:11,560 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4771 transitions. Word has length 81 [2024-11-11 22:49:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:11,561 INFO L471 AbstractCegarLoop]: Abstraction has 3043 states and 4771 transitions. [2024-11-11 22:49:11,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:49:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4771 transitions. [2024-11-11 22:49:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:49:11,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:11,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:49:11,562 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:11,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:11,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1477967535, now seen corresponding path program 1 times [2024-11-11 22:49:11,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:11,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317870070] [2024-11-11 22:49:11,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:11,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:11,617 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:49:11,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:11,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317870070] [2024-11-11 22:49:11,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317870070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:11,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:11,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:49:11,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757530559] [2024-11-11 22:49:11,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:11,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:49:11,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:11,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:49:11,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:49:11,619 INFO L87 Difference]: Start difference. First operand 3043 states and 4771 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:49:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:11,677 INFO L93 Difference]: Finished difference Result 5879 states and 9045 transitions. [2024-11-11 22:49:11,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:49:11,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 22:49:11,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:11,689 INFO L225 Difference]: With dead ends: 5879 [2024-11-11 22:49:11,690 INFO L226 Difference]: Without dead ends: 4397 [2024-11-11 22:49:11,692 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:49:11,693 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 1509 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 1747 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:49:11,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 1747 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:49:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2024-11-11 22:49:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 4395. [2024-11-11 22:49:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4395 states, 4393 states have (on average 1.539494650580469) internal successors, (6763), 4394 states have internal predecessors, (6763), 0 states have call successors, (0), 0 states 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:49:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6763 transitions. [2024-11-11 22:49:11,782 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6763 transitions. Word has length 81 [2024-11-11 22:49:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:11,782 INFO L471 AbstractCegarLoop]: Abstraction has 4395 states and 6763 transitions. [2024-11-11 22:49:11,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:49:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6763 transitions. [2024-11-11 22:49:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:49:11,783 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:11,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:49:11,784 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:11,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:11,784 INFO L85 PathProgramCache]: Analyzing trace with hash 302965329, now seen corresponding path program 1 times [2024-11-11 22:49:11,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:11,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704334057] [2024-11-11 22:49:11,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:11,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:11,832 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:49:11,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:11,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704334057] [2024-11-11 22:49:11,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704334057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:11,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:11,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:49:11,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014635859] [2024-11-11 22:49:11,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:11,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:49:11,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:11,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:49:11,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:49:11,833 INFO L87 Difference]: Start difference. First operand 4395 states and 6763 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:49:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:11,921 INFO L93 Difference]: Finished difference Result 9807 states and 14797 transitions. [2024-11-11 22:49:11,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:49:11,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 22:49:11,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:11,949 INFO L225 Difference]: With dead ends: 9807 [2024-11-11 22:49:11,951 INFO L226 Difference]: Without dead ends: 6973 [2024-11-11 22:49:11,957 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:49:11,957 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 1507 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1749 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:49:11,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1749 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:49:11,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6973 states. [2024-11-11 22:49:12,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6973 to 6971. [2024-11-11 22:49:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6971 states, 6969 states have (on average 1.5053809728798966) internal successors, (10491), 6970 states have internal predecessors, (10491), 0 states have call successors, (0), 0 states 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:49:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6971 states to 6971 states and 10491 transitions. [2024-11-11 22:49:12,106 INFO L78 Accepts]: Start accepts. Automaton has 6971 states and 10491 transitions. Word has length 81 [2024-11-11 22:49:12,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:12,106 INFO L471 AbstractCegarLoop]: Abstraction has 6971 states and 10491 transitions. [2024-11-11 22:49:12,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:49:12,106 INFO L276 IsEmpty]: Start isEmpty. Operand 6971 states and 10491 transitions. [2024-11-11 22:49:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:49:12,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:12,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:12,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:49:12,107 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:12,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:12,108 INFO L85 PathProgramCache]: Analyzing trace with hash -500760751, now seen corresponding path program 1 times [2024-11-11 22:49:12,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:12,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896329104] [2024-11-11 22:49:12,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:12,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:12,157 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:49:12,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:12,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896329104] [2024-11-11 22:49:12,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896329104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:12,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:12,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:49:12,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185282263] [2024-11-11 22:49:12,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:12,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:49:12,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:12,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:49:12,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:49:12,159 INFO L87 Difference]: Start difference. First operand 6971 states and 10491 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:49:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:12,347 INFO L93 Difference]: Finished difference Result 17279 states and 25533 transitions. [2024-11-11 22:49:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:49:12,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-11 22:49:12,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:12,367 INFO L225 Difference]: With dead ends: 17279 [2024-11-11 22:49:12,367 INFO L226 Difference]: Without dead ends: 11869 [2024-11-11 22:49:12,374 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:49:12,374 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 1513 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1751 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:49:12,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1751 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:49:12,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2024-11-11 22:49:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 11867. [2024-11-11 22:49:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11867 states, 11865 states have (on average 1.4694479561736198) internal successors, (17435), 11866 states have internal predecessors, (17435), 0 states have call successors, (0), 0 states 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:49:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 17435 transitions. [2024-11-11 22:49:12,692 INFO L78 Accepts]: Start accepts. Automaton has 11867 states and 17435 transitions. Word has length 81 [2024-11-11 22:49:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:12,693 INFO L471 AbstractCegarLoop]: Abstraction has 11867 states and 17435 transitions. [2024-11-11 22:49:12,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:49:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 11867 states and 17435 transitions. [2024-11-11 22:49:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 22:49:12,694 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:12,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:12,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:49:12,695 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:12,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:12,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1125158260, now seen corresponding path program 1 times [2024-11-11 22:49:12,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:12,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3574060] [2024-11-11 22:49:12,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:12,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:12,750 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:49:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3574060] [2024-11-11 22:49:12,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3574060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:12,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:12,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:49:12,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976792986] [2024-11-11 22:49:12,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:12,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:49:12,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:12,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:49:12,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:49:12,752 INFO L87 Difference]: Start difference. First operand 11867 states and 17435 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:49:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:12,977 INFO L93 Difference]: Finished difference Result 22626 states and 33185 transitions. [2024-11-11 22:49:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:49:12,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-11 22:49:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:13,005 INFO L225 Difference]: With dead ends: 22626 [2024-11-11 22:49:13,006 INFO L226 Difference]: Without dead ends: 16863 [2024-11-11 22:49:13,017 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:49:13,018 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 1516 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1748 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:49:13,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:49:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16863 states. [2024-11-11 22:49:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16863 to 16861. [2024-11-11 22:49:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16861 states, 16859 states have (on average 1.455661664392906) internal successors, (24541), 16860 states have internal predecessors, (24541), 0 states have call successors, (0), 0 states 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:49:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16861 states to 16861 states and 24541 transitions. [2024-11-11 22:49:13,368 INFO L78 Accepts]: Start accepts. Automaton has 16861 states and 24541 transitions. Word has length 83 [2024-11-11 22:49:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:13,369 INFO L471 AbstractCegarLoop]: Abstraction has 16861 states and 24541 transitions. [2024-11-11 22:49:13,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:49:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 16861 states and 24541 transitions. [2024-11-11 22:49:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-11 22:49:13,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:13,370 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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:49:13,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:49:13,370 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:13,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:13,371 INFO L85 PathProgramCache]: Analyzing trace with hash 422883728, now seen corresponding path program 1 times [2024-11-11 22:49:13,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:13,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143367650] [2024-11-11 22:49:13,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:49:13,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:13,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143367650] [2024-11-11 22:49:13,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143367650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:13,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:13,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:49:13,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619168830] [2024-11-11 22:49:13,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:13,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:49:13,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:13,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:49:13,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:49:13,484 INFO L87 Difference]: Start difference. First operand 16861 states and 24541 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:49:16,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:16,087 INFO L93 Difference]: Finished difference Result 19867 states and 29468 transitions. [2024-11-11 22:49:16,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:49:16,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-11 22:49:16,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:16,115 INFO L225 Difference]: With dead ends: 19867 [2024-11-11 22:49:16,115 INFO L226 Difference]: Without dead ends: 18363 [2024-11-11 22:49:16,124 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:49:16,125 INFO L435 NwaCegarLoop]: 1295 mSDtfsCounter, 753 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:49:16,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1449 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 22:49:16,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18363 states. [2024-11-11 22:49:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18363 to 18363. [2024-11-11 22:49:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18363 states, 18361 states have (on average 1.45400577310604) internal successors, (26697), 18362 states have internal predecessors, (26697), 0 states have call successors, (0), 0 states 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:49:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18363 states to 18363 states and 26697 transitions. [2024-11-11 22:49:16,525 INFO L78 Accepts]: Start accepts. Automaton has 18363 states and 26697 transitions. Word has length 87 [2024-11-11 22:49:16,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:16,525 INFO L471 AbstractCegarLoop]: Abstraction has 18363 states and 26697 transitions. [2024-11-11 22:49:16,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:49:16,526 INFO L276 IsEmpty]: Start isEmpty. Operand 18363 states and 26697 transitions. [2024-11-11 22:49:16,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-11 22:49:16,526 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:16,527 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:16,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:49:16,527 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:16,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1983493873, now seen corresponding path program 1 times [2024-11-11 22:49:16,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:16,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57781338] [2024-11-11 22:49:16,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:16,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:49:16,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:16,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57781338] [2024-11-11 22:49:16,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57781338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:16,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:16,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:49:16,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261441853] [2024-11-11 22:49:16,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:16,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:49:16,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:16,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:49:16,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:49:16,588 INFO L87 Difference]: Start difference. First operand 18363 states and 26697 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:49:18,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:18,878 INFO L93 Difference]: Finished difference Result 24375 states and 35937 transitions. [2024-11-11 22:49:18,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:49:18,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-11 22:49:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:18,909 INFO L225 Difference]: With dead ends: 24375 [2024-11-11 22:49:18,909 INFO L226 Difference]: Without dead ends: 21369 [2024-11-11 22:49:18,922 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:49:18,923 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 872 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2272 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:49:18,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 646 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2272 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 22:49:18,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21369 states. [2024-11-11 22:49:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21369 to 21367. [2024-11-11 22:49:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21367 states, 21365 states have (on average 1.4171776269599812) internal successors, (30278), 21366 states have internal predecessors, (30278), 0 states have call successors, (0), 0 states 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:49:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21367 states to 21367 states and 30278 transitions. [2024-11-11 22:49:19,299 INFO L78 Accepts]: Start accepts. Automaton has 21367 states and 30278 transitions. Word has length 90 [2024-11-11 22:49:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:19,299 INFO L471 AbstractCegarLoop]: Abstraction has 21367 states and 30278 transitions. [2024-11-11 22:49:19,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:49:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 21367 states and 30278 transitions. [2024-11-11 22:49:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-11 22:49:19,303 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:19,303 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:19,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:49:19,303 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:19,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:19,304 INFO L85 PathProgramCache]: Analyzing trace with hash 167267098, now seen corresponding path program 1 times [2024-11-11 22:49:19,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:19,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928598563] [2024-11-11 22:49:19,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:19,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:49:19,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:19,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928598563] [2024-11-11 22:49:19,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928598563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:19,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:19,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:49:19,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388274277] [2024-11-11 22:49:19,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:19,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:49:19,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:19,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:49:19,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:49:19,356 INFO L87 Difference]: Start difference. First operand 21367 states and 30278 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:49:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:21,824 INFO L93 Difference]: Finished difference Result 33387 states and 46680 transitions. [2024-11-11 22:49:21,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:49:21,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-11 22:49:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:21,861 INFO L225 Difference]: With dead ends: 33387 [2024-11-11 22:49:21,862 INFO L226 Difference]: Without dead ends: 27377 [2024-11-11 22:49:21,874 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:49:21,874 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 1061 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:49:21,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 741 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 22:49:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27377 states. [2024-11-11 22:49:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27377 to 27375. [2024-11-11 22:49:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27375 states, 27373 states have (on average 1.368209549556132) internal successors, (37452), 27374 states have internal predecessors, (37452), 0 states have call successors, (0), 0 states 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:49:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27375 states to 27375 states and 37452 transitions. [2024-11-11 22:49:22,404 INFO L78 Accepts]: Start accepts. Automaton has 27375 states and 37452 transitions. Word has length 91 [2024-11-11 22:49:22,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:22,405 INFO L471 AbstractCegarLoop]: Abstraction has 27375 states and 37452 transitions. [2024-11-11 22:49:22,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:49:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 27375 states and 37452 transitions. [2024-11-11 22:49:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:49:22,410 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:22,410 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:22,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:49:22,410 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:22,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash -293163275, now seen corresponding path program 1 times [2024-11-11 22:49:22,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:22,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348428404] [2024-11-11 22:49:22,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:22,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 22:49:22,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:22,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348428404] [2024-11-11 22:49:22,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348428404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:22,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:22,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:49:22,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006273457] [2024-11-11 22:49:22,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:22,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:49:22,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:22,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:49:22,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:49:22,657 INFO L87 Difference]: Start difference. First operand 27375 states and 37452 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:49:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:23,958 INFO L93 Difference]: Finished difference Result 137599 states and 195924 transitions. [2024-11-11 22:49:23,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:49:23,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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 104 [2024-11-11 22:49:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:24,118 INFO L225 Difference]: With dead ends: 137599 [2024-11-11 22:49:24,118 INFO L226 Difference]: Without dead ends: 122301 [2024-11-11 22:49:24,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:49:24,164 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 9903 mSDsluCounter, 2770 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9903 SdHoareTripleChecker+Valid, 4445 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:49:24,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9903 Valid, 4445 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:49:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122301 states. [2024-11-11 22:49:25,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122301 to 42671. [2024-11-11 22:49:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42671 states, 42669 states have (on average 1.3892052778363684) internal successors, (59276), 42670 states have internal predecessors, (59276), 0 states have call successors, (0), 0 states 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:49:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42671 states to 42671 states and 59276 transitions. [2024-11-11 22:49:25,528 INFO L78 Accepts]: Start accepts. Automaton has 42671 states and 59276 transitions. Word has length 104 [2024-11-11 22:49:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:25,528 INFO L471 AbstractCegarLoop]: Abstraction has 42671 states and 59276 transitions. [2024-11-11 22:49:25,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:49:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 42671 states and 59276 transitions. [2024-11-11 22:49:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:49:25,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:25,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:25,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:49:25,534 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:25,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:25,534 INFO L85 PathProgramCache]: Analyzing trace with hash -130248715, now seen corresponding path program 1 times [2024-11-11 22:49:25,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:25,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520100822] [2024-11-11 22:49:25,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:25,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 22:49:25,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:25,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520100822] [2024-11-11 22:49:25,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520100822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:25,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:25,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:49:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807756567] [2024-11-11 22:49:25,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:25,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:49:25,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:25,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:49:25,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:49:25,715 INFO L87 Difference]: Start difference. First operand 42671 states and 59276 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:49:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:28,061 INFO L93 Difference]: Finished difference Result 152895 states and 217748 transitions. [2024-11-11 22:49:28,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:49:28,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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 104 [2024-11-11 22:49:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:28,213 INFO L225 Difference]: With dead ends: 152895 [2024-11-11 22:49:28,214 INFO L226 Difference]: Without dead ends: 137597 [2024-11-11 22:49:28,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:49:28,244 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 9953 mSDsluCounter, 2603 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9953 SdHoareTripleChecker+Valid, 4275 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:49:28,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9953 Valid, 4275 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:49:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137597 states. [2024-11-11 22:49:29,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137597 to 65647. [2024-11-11 22:49:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65647 states, 65645 states have (on average 1.3992230939142356) internal successors, (91852), 65646 states have internal predecessors, (91852), 0 states have call successors, (0), 0 states 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:49:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65647 states to 65647 states and 91852 transitions. [2024-11-11 22:49:30,014 INFO L78 Accepts]: Start accepts. Automaton has 65647 states and 91852 transitions. Word has length 104 [2024-11-11 22:49:30,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:30,014 INFO L471 AbstractCegarLoop]: Abstraction has 65647 states and 91852 transitions. [2024-11-11 22:49:30,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:49:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 65647 states and 91852 transitions. [2024-11-11 22:49:30,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:49:30,020 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:30,020 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:30,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:49:30,021 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:30,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:30,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1371869685, now seen corresponding path program 1 times [2024-11-11 22:49:30,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:30,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225712211] [2024-11-11 22:49:30,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 22:49:30,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:30,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225712211] [2024-11-11 22:49:30,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225712211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:30,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:30,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:49:30,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108837722] [2024-11-11 22:49:30,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:30,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:49:30,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:30,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:49:30,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:49:30,186 INFO L87 Difference]: Start difference. First operand 65647 states and 91852 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:49:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:32,992 INFO L93 Difference]: Finished difference Result 168191 states and 239572 transitions. [2024-11-11 22:49:32,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:49:32,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 104 [2024-11-11 22:49:32,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:33,178 INFO L225 Difference]: With dead ends: 168191 [2024-11-11 22:49:33,179 INFO L226 Difference]: Without dead ends: 152893 [2024-11-11 22:49:33,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:49:33,212 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 10022 mSDsluCounter, 2637 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10022 SdHoareTripleChecker+Valid, 4306 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:49:33,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10022 Valid, 4306 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:49:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152893 states. [2024-11-11 22:49:35,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152893 to 80943. [2024-11-11 22:49:35,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80943 states, 80941 states have (on average 1.404430387566252) internal successors, (113676), 80942 states have internal predecessors, (113676), 0 states have call successors, (0), 0 states 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:49:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80943 states to 80943 states and 113676 transitions. [2024-11-11 22:49:35,785 INFO L78 Accepts]: Start accepts. Automaton has 80943 states and 113676 transitions. Word has length 104 [2024-11-11 22:49:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:35,785 INFO L471 AbstractCegarLoop]: Abstraction has 80943 states and 113676 transitions. [2024-11-11 22:49:35,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:49:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 80943 states and 113676 transitions. [2024-11-11 22:49:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:49:35,792 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:35,792 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:35,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:49:35,792 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:35,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:35,793 INFO L85 PathProgramCache]: Analyzing trace with hash -843599115, now seen corresponding path program 1 times [2024-11-11 22:49:35,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:35,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262070908] [2024-11-11 22:49:35,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:35,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 22:49:36,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262070908] [2024-11-11 22:49:36,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262070908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:36,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:36,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:49:36,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433692624] [2024-11-11 22:49:36,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:36,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:49:36,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:36,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:49:36,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:49:36,136 INFO L87 Difference]: Start difference. First operand 80943 states and 113676 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:49:39,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:39,229 INFO L93 Difference]: Finished difference Result 183487 states and 261396 transitions. [2024-11-11 22:49:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:49:39,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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 104 [2024-11-11 22:49:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:39,428 INFO L225 Difference]: With dead ends: 183487 [2024-11-11 22:49:39,429 INFO L226 Difference]: Without dead ends: 168189 [2024-11-11 22:49:39,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:49:39,464 INFO L435 NwaCegarLoop]: 1666 mSDtfsCounter, 10093 mSDsluCounter, 2577 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10093 SdHoareTripleChecker+Valid, 4243 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:49:39,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10093 Valid, 4243 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:49:39,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168189 states. [2024-11-11 22:49:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168189 to 96239. [2024-11-11 22:49:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96239 states, 96237 states have (on average 1.4079823768405084) internal successors, (135500), 96238 states have internal predecessors, (135500), 0 states have call successors, (0), 0 states 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:49:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96239 states to 96239 states and 135500 transitions. [2024-11-11 22:49:42,386 INFO L78 Accepts]: Start accepts. Automaton has 96239 states and 135500 transitions. Word has length 104 [2024-11-11 22:49:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:42,386 INFO L471 AbstractCegarLoop]: Abstraction has 96239 states and 135500 transitions. [2024-11-11 22:49:42,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:49:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 96239 states and 135500 transitions. [2024-11-11 22:49:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:49:42,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:42,392 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:42,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 22:49:42,393 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:42,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash 937333749, now seen corresponding path program 1 times [2024-11-11 22:49:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:42,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954122979] [2024-11-11 22:49:42,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:42,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 22:49:42,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:42,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954122979] [2024-11-11 22:49:42,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954122979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:42,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:42,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:49:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032547209] [2024-11-11 22:49:42,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:42,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:49:42,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:42,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:49:42,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:49:42,579 INFO L87 Difference]: Start difference. First operand 96239 states and 135500 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:49:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:49:46,178 INFO L93 Difference]: Finished difference Result 198783 states and 283220 transitions. [2024-11-11 22:49:46,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:49:46,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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 104 [2024-11-11 22:49:46,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:49:46,393 INFO L225 Difference]: With dead ends: 198783 [2024-11-11 22:49:46,394 INFO L226 Difference]: Without dead ends: 183485 [2024-11-11 22:49:46,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:49:46,434 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 9939 mSDsluCounter, 2685 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9939 SdHoareTripleChecker+Valid, 4354 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:49:46,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9939 Valid, 4354 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:49:46,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183485 states. [2024-11-11 22:49:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183485 to 111535. [2024-11-11 22:49:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111535 states, 111533 states have (on average 1.4105601032878161) internal successors, (157324), 111534 states have internal predecessors, (157324), 0 states have call successors, (0), 0 states 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:49:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111535 states to 111535 states and 157324 transitions. [2024-11-11 22:49:49,475 INFO L78 Accepts]: Start accepts. Automaton has 111535 states and 157324 transitions. Word has length 104 [2024-11-11 22:49:49,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:49:49,476 INFO L471 AbstractCegarLoop]: Abstraction has 111535 states and 157324 transitions. [2024-11-11 22:49:49,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:49:49,476 INFO L276 IsEmpty]: Start isEmpty. Operand 111535 states and 157324 transitions. [2024-11-11 22:49:49,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:49:49,480 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:49:49,480 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:49,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 22:49:49,481 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:49:49,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:49:49,481 INFO L85 PathProgramCache]: Analyzing trace with hash 133607669, now seen corresponding path program 1 times [2024-11-11 22:49:49,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:49:49,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347979144] [2024-11-11 22:49:49,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:49:49,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:49:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:49:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 22:49:49,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:49:49,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347979144] [2024-11-11 22:49:49,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347979144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:49:49,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:49:49,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:49:49,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496922513] [2024-11-11 22:49:49,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:49:49,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:49:49,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:49:49,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:49:49,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:49:49,794 INFO L87 Difference]: Start difference. First operand 111535 states and 157324 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)