./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label04.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.1.ufo.UNBOUNDED.pals+Problem12_label04.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 60deef9416523b76751360173835f47fa0a9731637794778250bb9a966714bf8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:47:56,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:47:56,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:47:56,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:47:56,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:47:56,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:47:56,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:47:56,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:47:56,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:47:56,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:47:56,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:47:56,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:47:56,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:47:56,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:47:56,795 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:47:56,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:47:56,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:47:56,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:47:56,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:47:56,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:47:56,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:47:56,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:47:56,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:47:56,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:47:56,801 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:47:56,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:47:56,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:47:56,802 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:47:56,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:47:56,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:47:56,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:47:56,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:47:56,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:47:56,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:47:56,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:47:56,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:47:56,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:47:56,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:47:56,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:47:56,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:47:56,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:47:56,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:47:56,806 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 -> 60deef9416523b76751360173835f47fa0a9731637794778250bb9a966714bf8 [2024-11-11 22:47:57,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:47:57,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:47:57,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:47:57,077 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:47:57,077 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:47:57,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-11 22:47:58,486 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:47:58,937 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:47:58,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-11 22:47:58,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/debebadbc/e46e9600e6964687b03eb8780940d50d/FLAGede8df7a2 [2024-11-11 22:47:59,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/debebadbc/e46e9600e6964687b03eb8780940d50d [2024-11-11 22:47:59,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:47:59,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:47:59,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:47:59,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:47:59,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:47:59,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:47:59" (1/1) ... [2024-11-11 22:47:59,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359e9137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:59, skipping insertion in model container [2024-11-11 22:47:59,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:47:59" (1/1) ... [2024-11-11 22:47:59,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:47:59,562 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.1.ufo.UNBOUNDED.pals+Problem12_label04.c[20491,20504] [2024-11-11 22:47:59,609 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.1.ufo.UNBOUNDED.pals+Problem12_label04.c[27552,27565] [2024-11-11 22:48:00,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:48:00,238 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:48:00,284 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.1.ufo.UNBOUNDED.pals+Problem12_label04.c[20491,20504] [2024-11-11 22:48:00,294 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.1.ufo.UNBOUNDED.pals+Problem12_label04.c[27552,27565] [2024-11-11 22:48:00,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:48:00,825 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:48:00,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:48:00 WrapperNode [2024-11-11 22:48:00,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:48:00,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:48:00,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:48:00,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:48:00,834 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:48:00" (1/1) ... [2024-11-11 22:48:00,884 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:48:00" (1/1) ... [2024-11-11 22:48:01,244 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5220 [2024-11-11 22:48:01,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:48:01,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:48:01,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:48:01,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:48:01,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:48:00" (1/1) ... [2024-11-11 22:48:01,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:48:00" (1/1) ... [2024-11-11 22:48:01,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:48:00" (1/1) ... [2024-11-11 22:48:01,570 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:48:01,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:48:00" (1/1) ... [2024-11-11 22:48:01,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:48:00" (1/1) ... [2024-11-11 22:48:01,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:48:00" (1/1) ... [2024-11-11 22:48:01,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:48:00" (1/1) ... [2024-11-11 22:48:01,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:48:00" (1/1) ... [2024-11-11 22:48:01,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:48:00" (1/1) ... [2024-11-11 22:48:01,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:48:01,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:48:01,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:48:01,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:48:01,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:48:00" (1/1) ... [2024-11-11 22:48:01,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:48:01,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:48:01,920 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:48:01,926 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:48:01,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:48:01,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:48:01,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:48:01,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:48:02,077 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:48:02,079 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:48:06,171 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-11-11 22:48:06,172 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:48:06,200 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:48:06,201 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 22:48:06,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:48:06 BoogieIcfgContainer [2024-11-11 22:48:06,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:48:06,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:48:06,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:48:06,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:48:06,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:47:59" (1/3) ... [2024-11-11 22:48:06,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6344cb43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:48:06, skipping insertion in model container [2024-11-11 22:48:06,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:48:00" (2/3) ... [2024-11-11 22:48:06,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6344cb43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:48:06, skipping insertion in model container [2024-11-11 22:48:06,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:48:06" (3/3) ... [2024-11-11 22:48:06,208 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-11 22:48:06,225 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:48:06,226 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:48:06,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:48:06,319 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;@490d3007, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:48:06,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:48:06,330 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:48:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 22:48:06,339 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:06,340 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:48:06,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:06,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:06,348 INFO L85 PathProgramCache]: Analyzing trace with hash -28928260, now seen corresponding path program 1 times [2024-11-11 22:48:06,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:06,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74057647] [2024-11-11 22:48:06,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:06,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:06,624 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:48:06,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74057647] [2024-11-11 22:48:06,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74057647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:06,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:06,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:48:06,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399263269] [2024-11-11 22:48:06,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:06,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 22:48:06,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:06,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 22:48:06,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 22:48:06,660 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 2 states, 2 states have (on average 14.0) internal successors, (28), 2 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:48:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:06,748 INFO L93 Difference]: Finished difference Result 1806 states and 3426 transitions. [2024-11-11 22:48:06,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 22:48:06,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 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:48:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:06,773 INFO L225 Difference]: With dead ends: 1806 [2024-11-11 22:48:06,774 INFO L226 Difference]: Without dead ends: 866 [2024-11-11 22:48:06,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 22:48:06,782 INFO L435 NwaCegarLoop]: 1699 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:48:06,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:48:06,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-11-11 22:48:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2024-11-11 22:48:06,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.8923611111111112) internal successors, (1635), 865 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states 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:48:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1635 transitions. [2024-11-11 22:48:06,860 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1635 transitions. Word has length 28 [2024-11-11 22:48:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:06,861 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1635 transitions. [2024-11-11 22:48:06,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 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:48:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1635 transitions. [2024-11-11 22:48:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 22:48:06,863 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:06,863 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:48:06,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:48:06,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:06,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:06,864 INFO L85 PathProgramCache]: Analyzing trace with hash 189926458, now seen corresponding path program 1 times [2024-11-11 22:48:06,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:06,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356093889] [2024-11-11 22:48:06,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:06,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:48:07,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:07,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356093889] [2024-11-11 22:48:07,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356093889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:07,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:07,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:48:07,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047479071] [2024-11-11 22:48:07,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:07,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:48:07,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:07,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:48:07,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:48:07,150 INFO L87 Difference]: Start difference. First operand 866 states and 1635 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:48:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:07,310 INFO L93 Difference]: Finished difference Result 926 states and 1729 transitions. [2024-11-11 22:48:07,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:48:07,311 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:48:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:07,315 INFO L225 Difference]: With dead ends: 926 [2024-11-11 22:48:07,315 INFO L226 Difference]: Without dead ends: 866 [2024-11-11 22:48:07,316 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:48:07,317 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 0 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:48:07,318 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.1s Time] [2024-11-11 22:48:07,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-11-11 22:48:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2024-11-11 22:48:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.8344907407407407) internal successors, (1585), 865 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states 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:48:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1585 transitions. [2024-11-11 22:48:07,349 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1585 transitions. Word has length 28 [2024-11-11 22:48:07,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:07,350 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1585 transitions. [2024-11-11 22:48:07,351 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:48:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1585 transitions. [2024-11-11 22:48:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-11 22:48:07,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:07,353 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] [2024-11-11 22:48:07,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:48:07,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:07,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:07,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2102133679, now seen corresponding path program 1 times [2024-11-11 22:48:07,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:07,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579479452] [2024-11-11 22:48:07,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:07,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:07,503 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:48:07,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:07,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579479452] [2024-11-11 22:48:07,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579479452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:07,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:07,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:48:07,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402845943] [2024-11-11 22:48:07,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:07,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:48:07,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:07,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:48:07,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:48:07,508 INFO L87 Difference]: Start difference. First operand 866 states and 1585 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:48:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:10,650 INFO L93 Difference]: Finished difference Result 2370 states and 4458 transitions. [2024-11-11 22:48:10,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:48:10,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-11 22:48:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:10,657 INFO L225 Difference]: With dead ends: 2370 [2024-11-11 22:48:10,657 INFO L226 Difference]: Without dead ends: 1617 [2024-11-11 22:48:10,658 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:48:10,659 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 886 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:48:10,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 621 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-11 22:48:10,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2024-11-11 22:48:10,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2024-11-11 22:48:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1615 states have (on average 1.5876160990712074) internal successors, (2564), 1616 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states 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:48:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2564 transitions. [2024-11-11 22:48:10,707 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2564 transitions. Word has length 61 [2024-11-11 22:48:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:10,711 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2564 transitions. [2024-11-11 22:48:10,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:48:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2564 transitions. [2024-11-11 22:48:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 22:48:10,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:10,717 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:48:10,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:48:10,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:10,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:10,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1109970983, now seen corresponding path program 1 times [2024-11-11 22:48:10,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:10,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094735395] [2024-11-11 22:48:10,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:10,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:10,994 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:48:10,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:10,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094735395] [2024-11-11 22:48:10,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094735395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:10,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:10,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:48:10,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654798476] [2024-11-11 22:48:10,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:10,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:48:10,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:10,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:48:10,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:48:10,997 INFO L87 Difference]: Start difference. First operand 1617 states and 2564 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:48:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:11,408 INFO L93 Difference]: Finished difference Result 2401 states and 3824 transitions. [2024-11-11 22:48:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:48:11,409 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:48:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:11,419 INFO L225 Difference]: With dead ends: 2401 [2024-11-11 22:48:11,419 INFO L226 Difference]: Without dead ends: 2345 [2024-11-11 22:48:11,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-11-11 22:48:11,421 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:48:11,422 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:48:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2024-11-11 22:48:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1671. [2024-11-11 22:48:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1669 states have (on average 1.5883762732174955) internal successors, (2651), 1670 states have internal predecessors, (2651), 0 states have call successors, (0), 0 states 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:48:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2651 transitions. [2024-11-11 22:48:11,470 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2651 transitions. Word has length 77 [2024-11-11 22:48:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:11,470 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2651 transitions. [2024-11-11 22:48:11,470 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:48:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2651 transitions. [2024-11-11 22:48:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:48:11,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:11,472 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:48:11,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:48:11,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:11,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1349050793, now seen corresponding path program 1 times [2024-11-11 22:48:11,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:11,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008054223] [2024-11-11 22:48:11,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:11,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:11,631 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:48:11,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008054223] [2024-11-11 22:48:11,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008054223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:11,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:11,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:48:11,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068711919] [2024-11-11 22:48:11,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:11,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:48:11,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:11,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:48:11,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:48:11,636 INFO L87 Difference]: Start difference. First operand 1671 states and 2651 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:48:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:11,678 INFO L93 Difference]: Finished difference Result 1880 states and 2986 transitions. [2024-11-11 22:48:11,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:48:11,679 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:48:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:11,686 INFO L225 Difference]: With dead ends: 1880 [2024-11-11 22:48:11,687 INFO L226 Difference]: Without dead ends: 1770 [2024-11-11 22:48:11,687 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:48:11,689 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:48:11,689 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:48:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2024-11-11 22:48:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1766. [2024-11-11 22:48:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.5878684807256236) internal successors, (2801), 1765 states have internal predecessors, (2801), 0 states have call successors, (0), 0 states 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:48:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2801 transitions. [2024-11-11 22:48:11,732 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2801 transitions. Word has length 79 [2024-11-11 22:48:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:11,732 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2801 transitions. [2024-11-11 22:48:11,732 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:48:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2801 transitions. [2024-11-11 22:48:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:48:11,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:11,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:11,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:48:11,734 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:11,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:11,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1415544305, now seen corresponding path program 1 times [2024-11-11 22:48:11,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:11,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022302252] [2024-11-11 22:48:11,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:11,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:12,218 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:48:12,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:12,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022302252] [2024-11-11 22:48:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022302252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:12,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:12,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:48:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560558031] [2024-11-11 22:48:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:12,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:48:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:12,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:48:12,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:48:12,221 INFO L87 Difference]: Start difference. First operand 1766 states and 2801 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:48:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:12,563 INFO L93 Difference]: Finished difference Result 1973 states and 3129 transitions. [2024-11-11 22:48:12,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:48:12,564 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:48:12,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:12,573 INFO L225 Difference]: With dead ends: 1973 [2024-11-11 22:48:12,573 INFO L226 Difference]: Without dead ends: 1768 [2024-11-11 22:48:12,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-11 22:48:12,575 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 3064 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3064 SdHoareTripleChecker+Valid, 2108 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:48:12,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3064 Valid, 2108 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:48:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2024-11-11 22:48:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1766. [2024-11-11 22:48:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.586734693877551) internal successors, (2799), 1765 states have internal predecessors, (2799), 0 states have call successors, (0), 0 states 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:48:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2799 transitions. [2024-11-11 22:48:12,620 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2799 transitions. Word has length 79 [2024-11-11 22:48:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:12,621 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2799 transitions. [2024-11-11 22:48:12,621 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:48:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2799 transitions. [2024-11-11 22:48:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 22:48:12,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:12,623 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:48:12,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:48:12,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:12,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash 517477589, now seen corresponding path program 1 times [2024-11-11 22:48:12,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:12,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076850275] [2024-11-11 22:48:12,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:12,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:12,909 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:48:12,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:12,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076850275] [2024-11-11 22:48:12,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076850275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:12,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:12,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:48:12,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327133167] [2024-11-11 22:48:12,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:12,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:48:12,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:12,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:48:12,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:48:12,911 INFO L87 Difference]: Start difference. First operand 1766 states and 2799 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:48:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:12,994 INFO L93 Difference]: Finished difference Result 1774 states and 2808 transitions. [2024-11-11 22:48:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 22:48:12,995 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:48:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:13,002 INFO L225 Difference]: With dead ends: 1774 [2024-11-11 22:48:13,003 INFO L226 Difference]: Without dead ends: 1772 [2024-11-11 22:48:13,003 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:48:13,009 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:48:13,009 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:48:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2024-11-11 22:48:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1772. [2024-11-11 22:48:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1770 states have (on average 1.584180790960452) internal successors, (2804), 1771 states have internal predecessors, (2804), 0 states have call successors, (0), 0 states 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:48:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2804 transitions. [2024-11-11 22:48:13,051 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2804 transitions. Word has length 80 [2024-11-11 22:48:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:13,051 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2804 transitions. [2024-11-11 22:48:13,051 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:48:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2804 transitions. [2024-11-11 22:48:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:48:13,055 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:13,055 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:48:13,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:48:13,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:13,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash -927531695, now seen corresponding path program 1 times [2024-11-11 22:48:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:13,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821796045] [2024-11-11 22:48:13,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:13,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:13,116 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:48:13,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:13,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821796045] [2024-11-11 22:48:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821796045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:13,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:13,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:48:13,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84231481] [2024-11-11 22:48:13,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:13,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:48:13,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:13,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:48:13,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:48:13,118 INFO L87 Difference]: Start difference. First operand 1772 states and 2804 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:48:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:13,150 INFO L93 Difference]: Finished difference Result 2178 states and 3436 transitions. [2024-11-11 22:48:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:48:13,150 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:48:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:13,157 INFO L225 Difference]: With dead ends: 2178 [2024-11-11 22:48:13,157 INFO L226 Difference]: Without dead ends: 1967 [2024-11-11 22:48:13,158 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:48:13,158 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:48:13,158 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:48:13,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2024-11-11 22:48:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1965. [2024-11-11 22:48:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1963 states have (on average 1.5797249108507387) internal successors, (3101), 1964 states have internal predecessors, (3101), 0 states have call successors, (0), 0 states 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:48:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 3101 transitions. [2024-11-11 22:48:13,196 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 3101 transitions. Word has length 81 [2024-11-11 22:48:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:13,197 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 3101 transitions. [2024-11-11 22:48:13,197 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:48:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 3101 transitions. [2024-11-11 22:48:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:48:13,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:13,198 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:48:13,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:48:13,198 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:13,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:13,199 INFO L85 PathProgramCache]: Analyzing trace with hash -764617135, now seen corresponding path program 1 times [2024-11-11 22:48:13,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:13,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524895080] [2024-11-11 22:48:13,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:13,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:13,257 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:48:13,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:13,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524895080] [2024-11-11 22:48:13,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524895080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:13,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:13,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:48:13,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700074325] [2024-11-11 22:48:13,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:13,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:48:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:13,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:48:13,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:48:13,259 INFO L87 Difference]: Start difference. First operand 1965 states and 3101 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:48:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:13,301 INFO L93 Difference]: Finished difference Result 2741 states and 4299 transitions. [2024-11-11 22:48:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:48:13,302 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:48:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:13,310 INFO L225 Difference]: With dead ends: 2741 [2024-11-11 22:48:13,310 INFO L226 Difference]: Without dead ends: 2337 [2024-11-11 22:48:13,311 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:48:13,313 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:48:13,314 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:48:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2024-11-11 22:48:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2335. [2024-11-11 22:48:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2333 states have (on average 1.5700814402057437) internal successors, (3663), 2334 states have internal predecessors, (3663), 0 states have call successors, (0), 0 states 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:48:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3663 transitions. [2024-11-11 22:48:13,366 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3663 transitions. Word has length 81 [2024-11-11 22:48:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:13,367 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3663 transitions. [2024-11-11 22:48:13,367 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:48:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3663 transitions. [2024-11-11 22:48:13,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:48:13,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:13,368 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:48:13,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:48:13,368 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:13,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:13,372 INFO L85 PathProgramCache]: Analyzing trace with hash 737501265, now seen corresponding path program 1 times [2024-11-11 22:48:13,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:13,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953449539] [2024-11-11 22:48:13,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:13,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:13,441 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:48:13,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:13,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953449539] [2024-11-11 22:48:13,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953449539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:13,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:13,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:48:13,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845872989] [2024-11-11 22:48:13,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:13,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:48:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:13,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:48:13,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:48:13,443 INFO L87 Difference]: Start difference. First operand 2335 states and 3663 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:48:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:13,490 INFO L93 Difference]: Finished difference Result 3819 states and 5929 transitions. [2024-11-11 22:48:13,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:48:13,490 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:48:13,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:13,500 INFO L225 Difference]: With dead ends: 3819 [2024-11-11 22:48:13,500 INFO L226 Difference]: Without dead ends: 3045 [2024-11-11 22:48:13,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:48:13,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:48:13,503 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:48:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2024-11-11 22:48:13,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 3043. [2024-11-11 22:48:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3043 states, 3041 states have (on average 1.5531075304176258) internal successors, (4723), 3042 states have internal predecessors, (4723), 0 states have call successors, (0), 0 states 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:48:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4723 transitions. [2024-11-11 22:48:13,640 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4723 transitions. Word has length 81 [2024-11-11 22:48:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:13,641 INFO L471 AbstractCegarLoop]: Abstraction has 3043 states and 4723 transitions. [2024-11-11 22:48:13,641 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:48:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4723 transitions. [2024-11-11 22:48:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:48:13,642 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:13,642 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:48:13,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:48:13,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:13,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:13,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1477967535, now seen corresponding path program 1 times [2024-11-11 22:48:13,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:13,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358041651] [2024-11-11 22:48:13,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:13,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:48:13,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:13,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358041651] [2024-11-11 22:48:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358041651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:13,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:13,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:48:13,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596000739] [2024-11-11 22:48:13,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:13,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:48:13,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:13,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:48:13,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:48:13,728 INFO L87 Difference]: Start difference. First operand 3043 states and 4723 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:48:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:13,830 INFO L93 Difference]: Finished difference Result 5879 states and 8997 transitions. [2024-11-11 22:48:13,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:48:13,831 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:48:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:13,847 INFO L225 Difference]: With dead ends: 5879 [2024-11-11 22:48:13,847 INFO L226 Difference]: Without dead ends: 4397 [2024-11-11 22:48:13,851 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:48:13,852 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:48:13,852 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:48:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2024-11-11 22:48:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 4395. [2024-11-11 22:48:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4395 states, 4393 states have (on average 1.528568176644662) internal successors, (6715), 4394 states have internal predecessors, (6715), 0 states have call successors, (0), 0 states 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:48:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6715 transitions. [2024-11-11 22:48:13,999 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6715 transitions. Word has length 81 [2024-11-11 22:48:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:13,999 INFO L471 AbstractCegarLoop]: Abstraction has 4395 states and 6715 transitions. [2024-11-11 22:48:14,000 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:48:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6715 transitions. [2024-11-11 22:48:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:48:14,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:14,001 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:48:14,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:48:14,002 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:14,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:14,002 INFO L85 PathProgramCache]: Analyzing trace with hash 302965329, now seen corresponding path program 1 times [2024-11-11 22:48:14,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:14,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439717342] [2024-11-11 22:48:14,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:14,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:14,075 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:48:14,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:14,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439717342] [2024-11-11 22:48:14,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439717342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:14,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:14,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:48:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715084252] [2024-11-11 22:48:14,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:14,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:48:14,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:14,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:48:14,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:48:14,078 INFO L87 Difference]: Start difference. First operand 4395 states and 6715 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:48:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:14,244 INFO L93 Difference]: Finished difference Result 9807 states and 14749 transitions. [2024-11-11 22:48:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:48:14,245 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:48:14,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:14,275 INFO L225 Difference]: With dead ends: 9807 [2024-11-11 22:48:14,275 INFO L226 Difference]: Without dead ends: 6973 [2024-11-11 22:48:14,284 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:48:14,284 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:48:14,284 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:48:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6973 states. [2024-11-11 22:48:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6973 to 6971. [2024-11-11 22:48:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6971 states, 6969 states have (on average 1.498493327593629) internal successors, (10443), 6970 states have internal predecessors, (10443), 0 states have call successors, (0), 0 states 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:48:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6971 states to 6971 states and 10443 transitions. [2024-11-11 22:48:14,533 INFO L78 Accepts]: Start accepts. Automaton has 6971 states and 10443 transitions. Word has length 81 [2024-11-11 22:48:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:14,533 INFO L471 AbstractCegarLoop]: Abstraction has 6971 states and 10443 transitions. [2024-11-11 22:48:14,534 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:48:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 6971 states and 10443 transitions. [2024-11-11 22:48:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:48:14,535 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:14,535 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:48:14,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:48:14,536 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:14,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash -500760751, now seen corresponding path program 1 times [2024-11-11 22:48:14,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:14,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973439616] [2024-11-11 22:48:14,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:14,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:48:14,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:14,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973439616] [2024-11-11 22:48:14,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973439616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:14,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:14,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:48:14,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300902681] [2024-11-11 22:48:14,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:14,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:48:14,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:14,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:48:14,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:48:14,602 INFO L87 Difference]: Start difference. First operand 6971 states and 10443 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:48:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:14,778 INFO L93 Difference]: Finished difference Result 17279 states and 25485 transitions. [2024-11-11 22:48:14,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:48:14,779 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:48:14,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:14,809 INFO L225 Difference]: With dead ends: 17279 [2024-11-11 22:48:14,809 INFO L226 Difference]: Without dead ends: 11869 [2024-11-11 22:48:14,820 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:48:14,821 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:48:14,821 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:48:14,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2024-11-11 22:48:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 11867. [2024-11-11 22:48:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11867 states, 11865 states have (on average 1.465402444163506) internal successors, (17387), 11866 states have internal predecessors, (17387), 0 states have call successors, (0), 0 states 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:48:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 17387 transitions. [2024-11-11 22:48:15,197 INFO L78 Accepts]: Start accepts. Automaton has 11867 states and 17387 transitions. Word has length 81 [2024-11-11 22:48:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:15,197 INFO L471 AbstractCegarLoop]: Abstraction has 11867 states and 17387 transitions. [2024-11-11 22:48:15,197 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:48:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 11867 states and 17387 transitions. [2024-11-11 22:48:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 22:48:15,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:15,199 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:48:15,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:48:15,199 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:15,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1125158260, now seen corresponding path program 1 times [2024-11-11 22:48:15,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:15,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046078394] [2024-11-11 22:48:15,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:15,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:15,263 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:48:15,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:15,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046078394] [2024-11-11 22:48:15,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046078394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:15,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:15,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:48:15,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826095323] [2024-11-11 22:48:15,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:15,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:48:15,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:15,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:48:15,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:48:15,265 INFO L87 Difference]: Start difference. First operand 11867 states and 17387 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:48:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:15,508 INFO L93 Difference]: Finished difference Result 22626 states and 33137 transitions. [2024-11-11 22:48:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:48:15,509 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:48:15,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:15,544 INFO L225 Difference]: With dead ends: 22626 [2024-11-11 22:48:15,545 INFO L226 Difference]: Without dead ends: 16863 [2024-11-11 22:48:15,559 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:48:15,560 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:48:15,560 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:48:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16863 states. [2024-11-11 22:48:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16863 to 16861. [2024-11-11 22:48:16,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16861 states, 16859 states have (on average 1.4528145204341893) internal successors, (24493), 16860 states have internal predecessors, (24493), 0 states have call successors, (0), 0 states 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:48:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16861 states to 16861 states and 24493 transitions. [2024-11-11 22:48:16,044 INFO L78 Accepts]: Start accepts. Automaton has 16861 states and 24493 transitions. Word has length 83 [2024-11-11 22:48:16,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:16,044 INFO L471 AbstractCegarLoop]: Abstraction has 16861 states and 24493 transitions. [2024-11-11 22:48:16,044 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:48:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 16861 states and 24493 transitions. [2024-11-11 22:48:16,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:48:16,049 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:16,049 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:48:16,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:48:16,050 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:16,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:16,050 INFO L85 PathProgramCache]: Analyzing trace with hash -293163275, now seen corresponding path program 1 times [2024-11-11 22:48:16,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:16,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418711269] [2024-11-11 22:48:16,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:16,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:16,361 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:48:16,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:16,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418711269] [2024-11-11 22:48:16,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418711269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:16,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:16,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:48:16,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033060562] [2024-11-11 22:48:16,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:16,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:48:16,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:16,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:48:16,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:48:16,365 INFO L87 Difference]: Start difference. First operand 16861 states and 24493 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:48:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:18,240 INFO L93 Difference]: Finished difference Result 127085 states and 182965 transitions. [2024-11-11 22:48:18,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:48:18,241 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:48:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:18,528 INFO L225 Difference]: With dead ends: 127085 [2024-11-11 22:48:18,528 INFO L226 Difference]: Without dead ends: 111787 [2024-11-11 22:48:18,575 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:48:18,576 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:48:18,577 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:48:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111787 states. [2024-11-11 22:48:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111787 to 32157. [2024-11-11 22:48:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32157 states, 32155 states have (on average 1.4404291712019903) internal successors, (46317), 32156 states have internal predecessors, (46317), 0 states have call successors, (0), 0 states 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:48:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32157 states to 32157 states and 46317 transitions. [2024-11-11 22:48:20,550 INFO L78 Accepts]: Start accepts. Automaton has 32157 states and 46317 transitions. Word has length 104 [2024-11-11 22:48:20,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:20,551 INFO L471 AbstractCegarLoop]: Abstraction has 32157 states and 46317 transitions. [2024-11-11 22:48:20,551 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:48:20,551 INFO L276 IsEmpty]: Start isEmpty. Operand 32157 states and 46317 transitions. [2024-11-11 22:48:20,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:48:20,556 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:20,557 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:48:20,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:48:20,557 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:20,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:20,558 INFO L85 PathProgramCache]: Analyzing trace with hash -130248715, now seen corresponding path program 1 times [2024-11-11 22:48:20,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:20,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906578867] [2024-11-11 22:48:20,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:20,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:20,797 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:48:20,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:20,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906578867] [2024-11-11 22:48:20,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906578867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:20,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:20,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:48:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425833153] [2024-11-11 22:48:20,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:20,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:48:20,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:20,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:48:20,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:48:20,801 INFO L87 Difference]: Start difference. First operand 32157 states and 46317 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:48:22,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:22,952 INFO L93 Difference]: Finished difference Result 142381 states and 204789 transitions. [2024-11-11 22:48:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:48:22,953 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:48:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:23,230 INFO L225 Difference]: With dead ends: 142381 [2024-11-11 22:48:23,231 INFO L226 Difference]: Without dead ends: 127083 [2024-11-11 22:48:23,266 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:48:23,267 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 9949 mSDsluCounter, 2633 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9949 SdHoareTripleChecker+Valid, 4305 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:48:23,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9949 Valid, 4305 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:48:23,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127083 states. [2024-11-11 22:48:25,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127083 to 55133. [2024-11-11 22:48:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55133 states, 55131 states have (on average 1.4310097767136456) internal successors, (78893), 55132 states have internal predecessors, (78893), 0 states have call successors, (0), 0 states 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:48:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55133 states to 55133 states and 78893 transitions. [2024-11-11 22:48:25,473 INFO L78 Accepts]: Start accepts. Automaton has 55133 states and 78893 transitions. Word has length 104 [2024-11-11 22:48:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:25,473 INFO L471 AbstractCegarLoop]: Abstraction has 55133 states and 78893 transitions. [2024-11-11 22:48:25,474 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:48:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 55133 states and 78893 transitions. [2024-11-11 22:48:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:48:25,480 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:25,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:48:25,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:48:25,480 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:25,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:25,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1371869685, now seen corresponding path program 1 times [2024-11-11 22:48:25,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:25,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276875553] [2024-11-11 22:48:25,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:25,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:25,840 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:48:25,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276875553] [2024-11-11 22:48:25,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276875553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:25,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:25,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:48:25,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801518852] [2024-11-11 22:48:25,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:25,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:48:25,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:25,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:48:25,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:48:25,843 INFO L87 Difference]: Start difference. First operand 55133 states and 78893 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:48:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:28,466 INFO L93 Difference]: Finished difference Result 157677 states and 226613 transitions. [2024-11-11 22:48:28,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:48:28,467 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:48:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:28,898 INFO L225 Difference]: With dead ends: 157677 [2024-11-11 22:48:28,898 INFO L226 Difference]: Without dead ends: 142379 [2024-11-11 22:48:28,927 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:48:28,928 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:48:28,928 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:48:28,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142379 states. [2024-11-11 22:48:31,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142379 to 70429. [2024-11-11 22:48:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70429 states, 70427 states have (on average 1.4300907322475755) internal successors, (100717), 70428 states have internal predecessors, (100717), 0 states have call successors, (0), 0 states 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:48:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70429 states to 70429 states and 100717 transitions. [2024-11-11 22:48:31,485 INFO L78 Accepts]: Start accepts. Automaton has 70429 states and 100717 transitions. Word has length 104 [2024-11-11 22:48:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:31,486 INFO L471 AbstractCegarLoop]: Abstraction has 70429 states and 100717 transitions. [2024-11-11 22:48:31,486 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:48:31,486 INFO L276 IsEmpty]: Start isEmpty. Operand 70429 states and 100717 transitions. [2024-11-11 22:48:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:48:31,496 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:31,496 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:48:31,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:48:31,497 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:31,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:31,497 INFO L85 PathProgramCache]: Analyzing trace with hash -843599115, now seen corresponding path program 1 times [2024-11-11 22:48:31,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:31,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915432105] [2024-11-11 22:48:31,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:31,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:31,766 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:48:31,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:31,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915432105] [2024-11-11 22:48:31,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915432105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:31,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:31,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:48:31,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831558231] [2024-11-11 22:48:31,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:31,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:48:31,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:31,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:48:31,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:48:31,769 INFO L87 Difference]: Start difference. First operand 70429 states and 100717 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:48:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:35,283 INFO L93 Difference]: Finished difference Result 172973 states and 248437 transitions. [2024-11-11 22:48:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:48:35,283 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:48:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:35,523 INFO L225 Difference]: With dead ends: 172973 [2024-11-11 22:48:35,523 INFO L226 Difference]: Without dead ends: 157675 [2024-11-11 22:48:35,566 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:48:35,567 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:48:35,567 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:48:35,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157675 states. [2024-11-11 22:48:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157675 to 85725. [2024-11-11 22:48:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85725 states, 85723 states have (on average 1.4294996675338008) internal successors, (122541), 85724 states have internal predecessors, (122541), 0 states have call successors, (0), 0 states 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:48:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85725 states to 85725 states and 122541 transitions. [2024-11-11 22:48:38,524 INFO L78 Accepts]: Start accepts. Automaton has 85725 states and 122541 transitions. Word has length 104 [2024-11-11 22:48:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:38,525 INFO L471 AbstractCegarLoop]: Abstraction has 85725 states and 122541 transitions. [2024-11-11 22:48:38,525 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:48:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 85725 states and 122541 transitions. [2024-11-11 22:48:38,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:48:38,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:38,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:48:38,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:48:38,534 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:38,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:38,535 INFO L85 PathProgramCache]: Analyzing trace with hash 937333749, now seen corresponding path program 1 times [2024-11-11 22:48:38,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:38,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842714668] [2024-11-11 22:48:38,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:38,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:38,792 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:48:38,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:38,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842714668] [2024-11-11 22:48:38,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842714668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:38,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:38,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:48:38,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114056226] [2024-11-11 22:48:38,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:38,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:48:38,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:38,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:48:38,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:48:38,796 INFO L87 Difference]: Start difference. First operand 85725 states and 122541 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:48:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:42,741 INFO L93 Difference]: Finished difference Result 188269 states and 270261 transitions. [2024-11-11 22:48:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:48:42,742 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:48:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:43,033 INFO L225 Difference]: With dead ends: 188269 [2024-11-11 22:48:43,033 INFO L226 Difference]: Without dead ends: 172971 [2024-11-11 22:48:43,080 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:48:43,081 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 9939 mSDsluCounter, 2685 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:48:43,081 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.2s Time] [2024-11-11 22:48:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172971 states. [2024-11-11 22:48:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172971 to 101021. [2024-11-11 22:48:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101021 states, 101019 states have (on average 1.4290875973826707) internal successors, (144365), 101020 states have internal predecessors, (144365), 0 states have call successors, (0), 0 states 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:48:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101021 states to 101021 states and 144365 transitions. [2024-11-11 22:48:46,634 INFO L78 Accepts]: Start accepts. Automaton has 101021 states and 144365 transitions. Word has length 104 [2024-11-11 22:48:46,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:46,635 INFO L471 AbstractCegarLoop]: Abstraction has 101021 states and 144365 transitions. [2024-11-11 22:48:46,635 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:48:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 101021 states and 144365 transitions. [2024-11-11 22:48:46,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:48:46,644 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:46,645 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:48:46,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:48:46,646 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:46,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:46,647 INFO L85 PathProgramCache]: Analyzing trace with hash 133607669, now seen corresponding path program 1 times [2024-11-11 22:48:46,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:46,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366607671] [2024-11-11 22:48:46,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:46,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:46,931 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:48:46,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:46,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366607671] [2024-11-11 22:48:46,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366607671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:46,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:46,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:48:46,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503278151] [2024-11-11 22:48:46,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:46,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:48:46,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:46,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:48:46,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:48:46,935 INFO L87 Difference]: Start difference. First operand 101021 states and 144365 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) [2024-11-11 22:48:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:50,968 INFO L93 Difference]: Finished difference Result 203565 states and 292085 transitions. [2024-11-11 22:48:50,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:48:50,969 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 104 [2024-11-11 22:48:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:51,269 INFO L225 Difference]: With dead ends: 203565 [2024-11-11 22:48:51,270 INFO L226 Difference]: Without dead ends: 188267 [2024-11-11 22:48:51,328 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:48:51,329 INFO L435 NwaCegarLoop]: 1674 mSDtfsCounter, 9837 mSDsluCounter, 2865 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9837 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:48:51,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9837 Valid, 4539 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:48:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188267 states. [2024-11-11 22:48:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188267 to 116317. [2024-11-11 22:48:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116317 states, 116315 states have (on average 1.4287839057731162) internal successors, (166189), 116316 states have internal predecessors, (166189), 0 states have call successors, (0), 0 states 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:48:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116317 states to 116317 states and 166189 transitions. [2024-11-11 22:48:55,438 INFO L78 Accepts]: Start accepts. Automaton has 116317 states and 166189 transitions. Word has length 104 [2024-11-11 22:48:55,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:55,438 INFO L471 AbstractCegarLoop]: Abstraction has 116317 states and 166189 transitions. [2024-11-11 22:48:55,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-11-11 22:48:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 116317 states and 166189 transitions. [2024-11-11 22:48:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-11 22:48:55,447 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:55,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-11 22:48:55,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 22:48:55,448 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:55,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:55,448 INFO L85 PathProgramCache]: Analyzing trace with hash 388736525, now seen corresponding path program 1 times [2024-11-11 22:48:55,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:55,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093763649] [2024-11-11 22:48:55,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:55,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:48:55,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:55,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093763649] [2024-11-11 22:48:55,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093763649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:55,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:55,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:48:55,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391411476] [2024-11-11 22:48:55,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:55,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:48:55,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:55,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:48:55,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:48:55,547 INFO L87 Difference]: Start difference. First operand 116317 states and 166189 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)