./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.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 927c21c2096a228a934a41e2a18844ff0d670b1b365a7d276a4e36116ab9babc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:15:36,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:15:36,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:15:36,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:15:36,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:15:36,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:15:36,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:15:36,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:15:36,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:15:36,265 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:15:36,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:15:36,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:15:36,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:15:36,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:15:36,269 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:15:36,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:15:36,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:15:36,270 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:15:36,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:15:36,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:15:36,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:15:36,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:15:36,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:15:36,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:15:36,275 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:15:36,276 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:15:36,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:15:36,276 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:15:36,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:15:36,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:15:36,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:15:36,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:15:36,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:15:36,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:15:36,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:15:36,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:15:36,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:15:36,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:15:36,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:15:36,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:15:36,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:15:36,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:15:36,281 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 -> 927c21c2096a228a934a41e2a18844ff0d670b1b365a7d276a4e36116ab9babc [2024-11-11 21:15:36,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:15:36,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:15:36,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:15:36,583 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:15:36,583 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:15:36,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2024-11-11 21:15:38,063 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:15:38,284 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:15:38,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2024-11-11 21:15:38,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3a4a587/3acc01eaeffc430fa5d66ddfb3829afa/FLAGf9a738e76 [2024-11-11 21:15:38,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3a4a587/3acc01eaeffc430fa5d66ddfb3829afa [2024-11-11 21:15:38,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:15:38,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:15:38,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:15:38,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:15:38,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:15:38,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:15:38" (1/1) ... [2024-11-11 21:15:38,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd14944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:38, skipping insertion in model container [2024-11-11 21:15:38,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:15:38" (1/1) ... [2024-11-11 21:15:38,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:15:38,943 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/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c[9376,9389] [2024-11-11 21:15:38,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:15:38,957 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:15:39,000 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/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c[9376,9389] [2024-11-11 21:15:39,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:15:39,023 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:15:39,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:39 WrapperNode [2024-11-11 21:15:39,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:15:39,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:15:39,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:15:39,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:15:39,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:39" (1/1) ... [2024-11-11 21:15:39,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:39" (1/1) ... [2024-11-11 21:15:39,079 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 313 [2024-11-11 21:15:39,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:15:39,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:15:39,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:15:39,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:15:39,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:39" (1/1) ... [2024-11-11 21:15:39,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:39" (1/1) ... [2024-11-11 21:15:39,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:39" (1/1) ... [2024-11-11 21:15:39,123 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 21:15:39,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:39" (1/1) ... [2024-11-11 21:15:39,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:39" (1/1) ... [2024-11-11 21:15:39,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:39" (1/1) ... [2024-11-11 21:15:39,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:39" (1/1) ... [2024-11-11 21:15:39,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:39" (1/1) ... [2024-11-11 21:15:39,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:39" (1/1) ... [2024-11-11 21:15:39,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:15:39,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:15:39,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:15:39,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:15:39,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:39" (1/1) ... [2024-11-11 21:15:39,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:15:39,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:15:39,200 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 21:15:39,203 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 21:15:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:15:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:15:39,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:15:39,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:15:39,369 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:15:39,373 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:15:39,882 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-11 21:15:39,883 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:15:39,895 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:15:39,896 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 21:15:39,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:15:39 BoogieIcfgContainer [2024-11-11 21:15:39,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:15:39,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:15:39,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:15:39,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:15:39,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:15:38" (1/3) ... [2024-11-11 21:15:39,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a75f1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:15:39, skipping insertion in model container [2024-11-11 21:15:39,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:15:39" (2/3) ... [2024-11-11 21:15:39,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a75f1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:15:39, skipping insertion in model container [2024-11-11 21:15:39,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:15:39" (3/3) ... [2024-11-11 21:15:39,906 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2024-11-11 21:15:39,920 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:15:39,920 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:15:39,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:15:39,988 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;@716bed6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:15:39,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:15:39,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 83 states have (on average 1.7228915662650603) internal successors, (143), 84 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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 21:15:39,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 21:15:39,999 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:40,000 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] [2024-11-11 21:15:40,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:40,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:40,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1338703135, now seen corresponding path program 1 times [2024-11-11 21:15:40,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:40,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699797279] [2024-11-11 21:15:40,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:40,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:40,269 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 21:15:40,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:40,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699797279] [2024-11-11 21:15:40,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699797279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:40,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:40,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 21:15:40,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796016016] [2024-11-11 21:15:40,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:40,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 21:15:40,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:40,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 21:15:40,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 21:15:40,314 INFO L87 Difference]: Start difference. First operand has 85 states, 83 states have (on average 1.7228915662650603) internal successors, (143), 84 states have internal predecessors, (143), 0 states have call successors, (0), 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.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:40,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:40,343 INFO L93 Difference]: Finished difference Result 137 states and 229 transitions. [2024-11-11 21:15:40,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 21:15:40,346 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-11 21:15:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:40,355 INFO L225 Difference]: With dead ends: 137 [2024-11-11 21:15:40,355 INFO L226 Difference]: Without dead ends: 81 [2024-11-11 21:15:40,359 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 21:15:40,364 INFO L435 NwaCegarLoop]: 136 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, 136 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 21:15:40,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-11 21:15:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-11 21:15:40,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.7) internal successors, (136), 80 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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 21:15:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 136 transitions. [2024-11-11 21:15:40,405 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 136 transitions. Word has length 29 [2024-11-11 21:15:40,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:40,405 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 136 transitions. [2024-11-11 21:15:40,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 136 transitions. [2024-11-11 21:15:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 21:15:40,407 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:40,407 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] [2024-11-11 21:15:40,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:15:40,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:40,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:40,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1472716641, now seen corresponding path program 1 times [2024-11-11 21:15:40,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:40,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963664811] [2024-11-11 21:15:40,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:40,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:40,765 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 21:15:40,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:40,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963664811] [2024-11-11 21:15:40,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963664811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:40,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:40,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:15:40,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955044560] [2024-11-11 21:15:40,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:40,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:15:40,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:40,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:15:40,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:15:40,773 INFO L87 Difference]: Start difference. First operand 81 states and 136 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:40,851 INFO L93 Difference]: Finished difference Result 136 states and 222 transitions. [2024-11-11 21:15:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:15:40,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-11 21:15:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:40,856 INFO L225 Difference]: With dead ends: 136 [2024-11-11 21:15:40,856 INFO L226 Difference]: Without dead ends: 81 [2024-11-11 21:15:40,858 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 21:15:40,859 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:40,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 507 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:15:40,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-11 21:15:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-11 21:15:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 21:15:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2024-11-11 21:15:40,872 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 29 [2024-11-11 21:15:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:40,872 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2024-11-11 21:15:40,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2024-11-11 21:15:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:15:40,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:40,875 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] [2024-11-11 21:15:40,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:15:40,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:40,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash -483680104, now seen corresponding path program 1 times [2024-11-11 21:15:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:40,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165507565] [2024-11-11 21:15:40,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:40,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:41,039 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 21:15:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165507565] [2024-11-11 21:15:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165507565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:41,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:41,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:41,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437286615] [2024-11-11 21:15:41,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:41,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:41,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:41,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:41,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:41,043 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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 21:15:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:41,078 INFO L93 Difference]: Finished difference Result 175 states and 262 transitions. [2024-11-11 21:15:41,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:41,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-11 21:15:41,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:41,081 INFO L225 Difference]: With dead ends: 175 [2024-11-11 21:15:41,081 INFO L226 Difference]: Without dead ends: 124 [2024-11-11 21:15:41,082 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 21:15:41,083 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 62 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:41,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 228 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:41,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-11 21:15:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2024-11-11 21:15:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.4710743801652892) internal successors, (178), 121 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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 21:15:41,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2024-11-11 21:15:41,099 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 52 [2024-11-11 21:15:41,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:41,099 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2024-11-11 21:15:41,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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 21:15:41,100 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2024-11-11 21:15:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:15:41,101 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:41,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:41,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:15:41,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:41,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:41,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1993840089, now seen corresponding path program 1 times [2024-11-11 21:15:41,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:41,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403097086] [2024-11-11 21:15:41,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:41,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:41,310 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 21:15:41,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:41,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403097086] [2024-11-11 21:15:41,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403097086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:41,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:41,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:41,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257159769] [2024-11-11 21:15:41,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:41,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:41,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:41,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:41,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:41,317 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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 21:15:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:41,462 INFO L93 Difference]: Finished difference Result 582 states and 918 transitions. [2024-11-11 21:15:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:41,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-11 21:15:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:41,467 INFO L225 Difference]: With dead ends: 582 [2024-11-11 21:15:41,468 INFO L226 Difference]: Without dead ends: 490 [2024-11-11 21:15:41,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:41,471 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 721 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:41,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 586 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:15:41,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-11 21:15:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 212. [2024-11-11 21:15:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.5213270142180095) internal successors, (321), 211 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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 21:15:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 321 transitions. [2024-11-11 21:15:41,499 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 321 transitions. Word has length 52 [2024-11-11 21:15:41,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:41,500 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 321 transitions. [2024-11-11 21:15:41,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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 21:15:41,500 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 321 transitions. [2024-11-11 21:15:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 21:15:41,502 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:41,502 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] [2024-11-11 21:15:41,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:15:41,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:41,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:41,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1296177241, now seen corresponding path program 1 times [2024-11-11 21:15:41,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:41,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448232391] [2024-11-11 21:15:41,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:41,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:41,871 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 21:15:41,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:41,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448232391] [2024-11-11 21:15:41,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448232391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:41,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:41,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:15:41,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466157540] [2024-11-11 21:15:41,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:41,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:15:41,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:41,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:15:41,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:15:41,878 INFO L87 Difference]: Start difference. First operand 212 states and 321 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:41,927 INFO L93 Difference]: Finished difference Result 226 states and 338 transitions. [2024-11-11 21:15:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:15:41,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-11 21:15:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:41,929 INFO L225 Difference]: With dead ends: 226 [2024-11-11 21:15:41,929 INFO L226 Difference]: Without dead ends: 224 [2024-11-11 21:15:41,930 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 21:15:41,931 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:41,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 730 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:41,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-11 21:15:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-11 21:15:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.493273542600897) internal successors, (333), 223 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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 21:15:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 333 transitions. [2024-11-11 21:15:41,952 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 333 transitions. Word has length 53 [2024-11-11 21:15:41,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:41,952 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 333 transitions. [2024-11-11 21:15:41,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:41,953 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 333 transitions. [2024-11-11 21:15:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 21:15:41,954 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:41,956 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] [2024-11-11 21:15:41,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:15:41,957 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:41,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1579367345, now seen corresponding path program 1 times [2024-11-11 21:15:41,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:41,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805875385] [2024-11-11 21:15:41,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:41,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:42,051 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 21:15:42,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:42,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805875385] [2024-11-11 21:15:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805875385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:42,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:42,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:42,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56161920] [2024-11-11 21:15:42,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:42,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:42,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:42,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:42,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:42,055 INFO L87 Difference]: Start difference. First operand 224 states and 333 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 21:15:42,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:42,078 INFO L93 Difference]: Finished difference Result 582 states and 889 transitions. [2024-11-11 21:15:42,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:42,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-11 21:15:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:42,082 INFO L225 Difference]: With dead ends: 582 [2024-11-11 21:15:42,084 INFO L226 Difference]: Without dead ends: 388 [2024-11-11 21:15:42,085 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 21:15:42,086 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 50 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:42,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 186 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-11 21:15:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 382. [2024-11-11 21:15:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.5039370078740157) internal successors, (573), 381 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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 21:15:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 573 transitions. [2024-11-11 21:15:42,113 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 573 transitions. Word has length 54 [2024-11-11 21:15:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:42,113 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 573 transitions. [2024-11-11 21:15:42,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 21:15:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 573 transitions. [2024-11-11 21:15:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:15:42,115 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:42,116 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] [2024-11-11 21:15:42,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:15:42,116 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:42,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:42,120 INFO L85 PathProgramCache]: Analyzing trace with hash 681636818, now seen corresponding path program 1 times [2024-11-11 21:15:42,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:42,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745687830] [2024-11-11 21:15:42,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:42,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:42,214 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 21:15:42,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:42,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745687830] [2024-11-11 21:15:42,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745687830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:42,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:42,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:42,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950026274] [2024-11-11 21:15:42,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:42,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:42,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:42,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:42,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:42,218 INFO L87 Difference]: Start difference. First operand 382 states and 573 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:42,252 INFO L93 Difference]: Finished difference Result 1022 states and 1547 transitions. [2024-11-11 21:15:42,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:42,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-11 21:15:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:42,258 INFO L225 Difference]: With dead ends: 1022 [2024-11-11 21:15:42,258 INFO L226 Difference]: Without dead ends: 670 [2024-11-11 21:15:42,258 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 21:15:42,261 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 58 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:42,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 226 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-11-11 21:15:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 668. [2024-11-11 21:15:42,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 667 states have (on average 1.4917541229385307) internal successors, (995), 667 states have internal predecessors, (995), 0 states have call successors, (0), 0 states 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 21:15:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 995 transitions. [2024-11-11 21:15:42,283 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 995 transitions. Word has length 55 [2024-11-11 21:15:42,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:42,285 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 995 transitions. [2024-11-11 21:15:42,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 995 transitions. [2024-11-11 21:15:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:15:42,290 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:42,290 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] [2024-11-11 21:15:42,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:15:42,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:42,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1818745234, now seen corresponding path program 1 times [2024-11-11 21:15:42,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:42,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355269224] [2024-11-11 21:15:42,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:42,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:42,358 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 21:15:42,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:42,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355269224] [2024-11-11 21:15:42,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355269224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:42,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:42,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741986030] [2024-11-11 21:15:42,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:42,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:42,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:42,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:42,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:42,360 INFO L87 Difference]: Start difference. First operand 668 states and 995 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:42,402 INFO L93 Difference]: Finished difference Result 1816 states and 2701 transitions. [2024-11-11 21:15:42,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:42,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-11 21:15:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:42,408 INFO L225 Difference]: With dead ends: 1816 [2024-11-11 21:15:42,408 INFO L226 Difference]: Without dead ends: 1178 [2024-11-11 21:15:42,409 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 21:15:42,410 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:42,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2024-11-11 21:15:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2024-11-11 21:15:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1175 states have (on average 1.4629787234042553) internal successors, (1719), 1175 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states 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 21:15:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1719 transitions. [2024-11-11 21:15:42,446 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1719 transitions. Word has length 55 [2024-11-11 21:15:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:42,447 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1719 transitions. [2024-11-11 21:15:42,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1719 transitions. [2024-11-11 21:15:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 21:15:42,448 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:42,448 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] [2024-11-11 21:15:42,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:15:42,448 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:42,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash -258348272, now seen corresponding path program 1 times [2024-11-11 21:15:42,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:42,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373513173] [2024-11-11 21:15:42,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:42,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:42,524 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 21:15:42,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:42,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373513173] [2024-11-11 21:15:42,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373513173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:42,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:42,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199595961] [2024-11-11 21:15:42,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:42,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:42,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:42,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:42,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:42,528 INFO L87 Difference]: Start difference. First operand 1176 states and 1719 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:42,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:42,570 INFO L93 Difference]: Finished difference Result 2319 states and 3421 transitions. [2024-11-11 21:15:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-11 21:15:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:42,579 INFO L225 Difference]: With dead ends: 2319 [2024-11-11 21:15:42,579 INFO L226 Difference]: Without dead ends: 1676 [2024-11-11 21:15:42,580 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 21:15:42,581 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 67 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:42,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 253 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2024-11-11 21:15:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1674. [2024-11-11 21:15:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1673 states have (on average 1.4542737597130904) internal successors, (2433), 1673 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states 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 21:15:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2433 transitions. [2024-11-11 21:15:42,631 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2433 transitions. Word has length 56 [2024-11-11 21:15:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:42,632 INFO L471 AbstractCegarLoop]: Abstraction has 1674 states and 2433 transitions. [2024-11-11 21:15:42,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2433 transitions. [2024-11-11 21:15:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:15:42,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:42,635 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] [2024-11-11 21:15:42,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:15:42,635 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:42,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:42,636 INFO L85 PathProgramCache]: Analyzing trace with hash -320122492, now seen corresponding path program 1 times [2024-11-11 21:15:42,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:42,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113530276] [2024-11-11 21:15:42,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:42,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:42,828 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 21:15:42,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:42,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113530276] [2024-11-11 21:15:42,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113530276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:42,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:42,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:42,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087881656] [2024-11-11 21:15:42,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:42,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:42,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:42,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:42,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:42,831 INFO L87 Difference]: Start difference. First operand 1674 states and 2433 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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 21:15:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:42,970 INFO L93 Difference]: Finished difference Result 4724 states and 6970 transitions. [2024-11-11 21:15:42,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:42,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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 78 [2024-11-11 21:15:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:42,984 INFO L225 Difference]: With dead ends: 4724 [2024-11-11 21:15:42,984 INFO L226 Difference]: Without dead ends: 3890 [2024-11-11 21:15:42,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:42,987 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 518 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:42,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 594 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:15:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2024-11-11 21:15:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 2482. [2024-11-11 21:15:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2482 states, 2481 states have (on average 1.456267634018541) internal successors, (3613), 2481 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states 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 21:15:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 3613 transitions. [2024-11-11 21:15:43,069 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 3613 transitions. Word has length 78 [2024-11-11 21:15:43,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:43,070 INFO L471 AbstractCegarLoop]: Abstraction has 2482 states and 3613 transitions. [2024-11-11 21:15:43,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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 21:15:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3613 transitions. [2024-11-11 21:15:43,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:15:43,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:43,075 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:15:43,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:15:43,075 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:43,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:43,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1605488763, now seen corresponding path program 1 times [2024-11-11 21:15:43,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:43,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047544952] [2024-11-11 21:15:43,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:43,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 21:15:43,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:43,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047544952] [2024-11-11 21:15:43,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047544952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:43,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:43,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:43,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131185534] [2024-11-11 21:15:43,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:43,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:43,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:43,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:43,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:43,247 INFO L87 Difference]: Start difference. First operand 2482 states and 3613 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 21:15:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:43,400 INFO L93 Difference]: Finished difference Result 5532 states and 8150 transitions. [2024-11-11 21:15:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:43,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 78 [2024-11-11 21:15:43,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:43,415 INFO L225 Difference]: With dead ends: 5532 [2024-11-11 21:15:43,416 INFO L226 Difference]: Without dead ends: 4698 [2024-11-11 21:15:43,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:43,419 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 508 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:43,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 617 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:15:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4698 states. [2024-11-11 21:15:43,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4698 to 3290. [2024-11-11 21:15:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3290 states, 3289 states have (on average 1.4572818485861965) internal successors, (4793), 3289 states have internal predecessors, (4793), 0 states have call successors, (0), 0 states 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 21:15:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 4793 transitions. [2024-11-11 21:15:43,506 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 4793 transitions. Word has length 78 [2024-11-11 21:15:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:43,507 INFO L471 AbstractCegarLoop]: Abstraction has 3290 states and 4793 transitions. [2024-11-11 21:15:43,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 21:15:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 4793 transitions. [2024-11-11 21:15:43,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:15:43,509 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:43,509 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:15:43,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:15:43,509 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:43,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash 140154659, now seen corresponding path program 1 times [2024-11-11 21:15:43,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:43,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645485429] [2024-11-11 21:15:43,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:43,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 21:15:43,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:43,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645485429] [2024-11-11 21:15:43,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645485429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:43,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:43,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:43,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544622949] [2024-11-11 21:15:43,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:43,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:43,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:43,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:43,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:43,663 INFO L87 Difference]: Start difference. First operand 3290 states and 4793 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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 21:15:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:43,828 INFO L93 Difference]: Finished difference Result 6340 states and 9330 transitions. [2024-11-11 21:15:43,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:43,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 78 [2024-11-11 21:15:43,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:43,845 INFO L225 Difference]: With dead ends: 6340 [2024-11-11 21:15:43,846 INFO L226 Difference]: Without dead ends: 5506 [2024-11-11 21:15:43,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:43,850 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 473 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:43,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 681 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:15:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2024-11-11 21:15:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 4098. [2024-11-11 21:15:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.457896021479131) internal successors, (5973), 4097 states have internal predecessors, (5973), 0 states have call successors, (0), 0 states 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 21:15:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5973 transitions. [2024-11-11 21:15:43,981 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5973 transitions. Word has length 78 [2024-11-11 21:15:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:43,981 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 5973 transitions. [2024-11-11 21:15:43,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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 21:15:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5973 transitions. [2024-11-11 21:15:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:15:43,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:43,984 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:15:43,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:15:43,984 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:43,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1548609917, now seen corresponding path program 1 times [2024-11-11 21:15:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:43,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174792894] [2024-11-11 21:15:43,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:44,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:44,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174792894] [2024-11-11 21:15:44,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174792894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:44,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:44,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067632935] [2024-11-11 21:15:44,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:44,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:44,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:44,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:44,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:44,095 INFO L87 Difference]: Start difference. First operand 4098 states and 5973 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 21:15:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:44,209 INFO L93 Difference]: Finished difference Result 8166 states and 11915 transitions. [2024-11-11 21:15:44,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:44,211 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 21:15:44,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:44,226 INFO L225 Difference]: With dead ends: 8166 [2024-11-11 21:15:44,227 INFO L226 Difference]: Without dead ends: 4100 [2024-11-11 21:15:44,231 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 21:15:44,233 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 53 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:44,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 240 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:44,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2024-11-11 21:15:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 4098. [2024-11-11 21:15:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.4432511593849158) internal successors, (5913), 4097 states have internal predecessors, (5913), 0 states have call successors, (0), 0 states 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 21:15:44,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5913 transitions. [2024-11-11 21:15:44,345 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5913 transitions. Word has length 79 [2024-11-11 21:15:44,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:44,346 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 5913 transitions. [2024-11-11 21:15:44,346 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 21:15:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5913 transitions. [2024-11-11 21:15:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:15:44,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:44,347 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:44,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:15:44,348 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:44,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:44,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1346852612, now seen corresponding path program 1 times [2024-11-11 21:15:44,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:44,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296141717] [2024-11-11 21:15:44,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:44,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:44,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:44,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296141717] [2024-11-11 21:15:44,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296141717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:44,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:44,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:44,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125124410] [2024-11-11 21:15:44,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:44,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:44,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:44,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:44,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:44,454 INFO L87 Difference]: Start difference. First operand 4098 states and 5913 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 21:15:44,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:44,535 INFO L93 Difference]: Finished difference Result 6134 states and 8855 transitions. [2024-11-11 21:15:44,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:44,536 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 21:15:44,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:44,546 INFO L225 Difference]: With dead ends: 6134 [2024-11-11 21:15:44,550 INFO L226 Difference]: Without dead ends: 2068 [2024-11-11 21:15:44,554 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 21:15:44,555 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 47 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:44,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 218 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2024-11-11 21:15:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2066. [2024-11-11 21:15:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 2065 states have (on average 1.425181598062954) internal successors, (2943), 2065 states have internal predecessors, (2943), 0 states have call successors, (0), 0 states 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 21:15:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 2943 transitions. [2024-11-11 21:15:44,611 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 2943 transitions. Word has length 79 [2024-11-11 21:15:44,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:44,611 INFO L471 AbstractCegarLoop]: Abstraction has 2066 states and 2943 transitions. [2024-11-11 21:15:44,612 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 21:15:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2943 transitions. [2024-11-11 21:15:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 21:15:44,613 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:44,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:44,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:15:44,613 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:44,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash -960604293, now seen corresponding path program 1 times [2024-11-11 21:15:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485042788] [2024-11-11 21:15:44,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:45,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:45,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:45,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485042788] [2024-11-11 21:15:45,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485042788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:15:45,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194815026] [2024-11-11 21:15:45,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:45,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:15:45,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:15:45,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:15:45,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:15:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:45,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-11 21:15:45,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:15:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:46,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:15:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:46,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194815026] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:15:46,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:15:46,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 11] total 31 [2024-11-11 21:15:46,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646137544] [2024-11-11 21:15:46,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:15:46,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-11 21:15:46,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:46,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-11 21:15:46,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2024-11-11 21:15:46,915 INFO L87 Difference]: Start difference. First operand 2066 states and 2943 transitions. Second operand has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 0 states have call successors, (0), 0 states 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 21:15:53,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:53,666 INFO L93 Difference]: Finished difference Result 18707 states and 26465 transitions. [2024-11-11 21:15:53,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-11 21:15:53,666 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 0 states have call successors, (0), 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 21:15:53,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:53,697 INFO L225 Difference]: With dead ends: 18707 [2024-11-11 21:15:53,697 INFO L226 Difference]: Without dead ends: 16673 [2024-11-11 21:15:53,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5638 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3254, Invalid=12246, Unknown=0, NotChecked=0, Total=15500 [2024-11-11 21:15:53,706 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 5898 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5898 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:53,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5898 Valid, 1843 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 21:15:53,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16673 states. [2024-11-11 21:15:54,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16673 to 14605. [2024-11-11 21:15:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14605 states, 14604 states have (on average 1.3900301287318544) internal successors, (20300), 14604 states have internal predecessors, (20300), 0 states have call successors, (0), 0 states 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 21:15:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14605 states to 14605 states and 20300 transitions. [2024-11-11 21:15:54,276 INFO L78 Accepts]: Start accepts. Automaton has 14605 states and 20300 transitions. Word has length 79 [2024-11-11 21:15:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:54,277 INFO L471 AbstractCegarLoop]: Abstraction has 14605 states and 20300 transitions. [2024-11-11 21:15:54,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 0 states have call successors, (0), 0 states 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 21:15:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 14605 states and 20300 transitions. [2024-11-11 21:15:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:15:54,279 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:54,279 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:54,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:15:54,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-11 21:15:54,484 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:54,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:54,485 INFO L85 PathProgramCache]: Analyzing trace with hash -226962490, now seen corresponding path program 1 times [2024-11-11 21:15:54,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:54,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271379638] [2024-11-11 21:15:54,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:54,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:15:54,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:54,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271379638] [2024-11-11 21:15:54,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271379638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:54,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:54,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:15:54,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417416858] [2024-11-11 21:15:54,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:54,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:15:54,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:54,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:15:54,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:15:54,631 INFO L87 Difference]: Start difference. First operand 14605 states and 20300 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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 21:15:55,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:55,178 INFO L93 Difference]: Finished difference Result 26669 states and 37382 transitions. [2024-11-11 21:15:55,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:15:55,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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 80 [2024-11-11 21:15:55,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:55,223 INFO L225 Difference]: With dead ends: 26669 [2024-11-11 21:15:55,224 INFO L226 Difference]: Without dead ends: 23621 [2024-11-11 21:15:55,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:15:55,235 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 459 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:55,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 785 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:15:55,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23621 states. [2024-11-11 21:15:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23621 to 17510. [2024-11-11 21:15:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17510 states, 17509 states have (on average 1.3889999428865154) internal successors, (24320), 17509 states have internal predecessors, (24320), 0 states have call successors, (0), 0 states 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 21:15:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17510 states to 17510 states and 24320 transitions. [2024-11-11 21:15:55,817 INFO L78 Accepts]: Start accepts. Automaton has 17510 states and 24320 transitions. Word has length 80 [2024-11-11 21:15:55,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:55,817 INFO L471 AbstractCegarLoop]: Abstraction has 17510 states and 24320 transitions. [2024-11-11 21:15:55,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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 21:15:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 17510 states and 24320 transitions. [2024-11-11 21:15:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 21:15:55,820 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:55,820 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:15:55,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:15:55,820 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:55,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:55,821 INFO L85 PathProgramCache]: Analyzing trace with hash -750605600, now seen corresponding path program 1 times [2024-11-11 21:15:55,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:55,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514117489] [2024-11-11 21:15:55,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:55,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:56,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:56,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514117489] [2024-11-11 21:15:56,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514117489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:15:56,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903277837] [2024-11-11 21:15:56,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:56,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:15:56,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:15:56,182 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:15:56,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:15:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:56,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 21:15:56,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:15:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:56,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:15:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:57,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903277837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:15:57,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:15:57,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-11 21:15:57,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086353550] [2024-11-11 21:15:57,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:15:57,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 21:15:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:57,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 21:15:57,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:15:57,791 INFO L87 Difference]: Start difference. First operand 17510 states and 24320 transitions. Second operand has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 22 states have internal predecessors, (192), 0 states have call successors, (0), 0 states 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 21:15:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:59,155 INFO L93 Difference]: Finished difference Result 69668 states and 97365 transitions. [2024-11-11 21:15:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 21:15:59,156 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 22 states have internal predecessors, (192), 0 states have call successors, (0), 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 21:15:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:59,239 INFO L225 Difference]: With dead ends: 69668 [2024-11-11 21:15:59,239 INFO L226 Difference]: Without dead ends: 52436 [2024-11-11 21:15:59,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=364, Invalid=1042, Unknown=0, NotChecked=0, Total=1406 [2024-11-11 21:15:59,268 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 1222 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:59,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 628 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:15:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52436 states. [2024-11-11 21:16:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52436 to 40681. [2024-11-11 21:16:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40681 states, 40680 states have (on average 1.3815388397246804) internal successors, (56201), 40680 states have internal predecessors, (56201), 0 states have call successors, (0), 0 states 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 21:16:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40681 states to 40681 states and 56201 transitions. [2024-11-11 21:16:00,610 INFO L78 Accepts]: Start accepts. Automaton has 40681 states and 56201 transitions. Word has length 83 [2024-11-11 21:16:00,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:00,611 INFO L471 AbstractCegarLoop]: Abstraction has 40681 states and 56201 transitions. [2024-11-11 21:16:00,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 22 states have internal predecessors, (192), 0 states have call successors, (0), 0 states 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 21:16:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 40681 states and 56201 transitions. [2024-11-11 21:16:00,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 21:16:00,613 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:00,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:16:00,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:16:00,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 21:16:00,818 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:00,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:00,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1726914593, now seen corresponding path program 1 times [2024-11-11 21:16:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:00,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140133943] [2024-11-11 21:16:00,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:00,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:00,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:00,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140133943] [2024-11-11 21:16:00,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140133943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:00,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:00,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:00,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326164486] [2024-11-11 21:16:00,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:00,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:00,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:00,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:00,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:00,942 INFO L87 Difference]: Start difference. First operand 40681 states and 56201 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 21:16:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:01,807 INFO L93 Difference]: Finished difference Result 63200 states and 87242 transitions. [2024-11-11 21:16:01,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:16:01,807 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 21:16:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:01,857 INFO L225 Difference]: With dead ends: 63200 [2024-11-11 21:16:01,858 INFO L226 Difference]: Without dead ends: 23004 [2024-11-11 21:16:01,903 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 21:16:01,905 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 31 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:01,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 205 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:16:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23004 states. [2024-11-11 21:16:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23004 to 23002. [2024-11-11 21:16:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23002 states, 23001 states have (on average 1.3542019912177732) internal successors, (31148), 23001 states have internal predecessors, (31148), 0 states have call successors, (0), 0 states 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 21:16:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23002 states to 23002 states and 31148 transitions. [2024-11-11 21:16:02,523 INFO L78 Accepts]: Start accepts. Automaton has 23002 states and 31148 transitions. Word has length 83 [2024-11-11 21:16:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:02,524 INFO L471 AbstractCegarLoop]: Abstraction has 23002 states and 31148 transitions. [2024-11-11 21:16:02,524 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 21:16:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 23002 states and 31148 transitions. [2024-11-11 21:16:02,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 21:16:02,526 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:02,526 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:16:02,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:16:02,526 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:02,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:02,527 INFO L85 PathProgramCache]: Analyzing trace with hash -775907934, now seen corresponding path program 1 times [2024-11-11 21:16:02,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:02,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953369366] [2024-11-11 21:16:02,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:02,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:03,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:03,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953369366] [2024-11-11 21:16:03,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953369366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:16:03,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226835340] [2024-11-11 21:16:03,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:03,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:16:03,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:16:03,736 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:16:03,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 21:16:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:03,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-11 21:16:03,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:16:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:04,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:16:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:06,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226835340] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:16:06,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:16:06,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 35 [2024-11-11 21:16:06,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784354796] [2024-11-11 21:16:06,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:16:06,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-11 21:16:06,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:06,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-11 21:16:06,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2024-11-11 21:16:06,256 INFO L87 Difference]: Start difference. First operand 23002 states and 31148 transitions. Second operand has 35 states, 35 states have (on average 6.371428571428571) internal successors, (223), 35 states have internal predecessors, (223), 0 states have call successors, (0), 0 states 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 21:16:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:25,852 INFO L93 Difference]: Finished difference Result 478999 states and 643897 transitions. [2024-11-11 21:16:25,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2024-11-11 21:16:25,852 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.371428571428571) internal successors, (223), 35 states have internal predecessors, (223), 0 states have call successors, (0), 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 21:16:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:26,735 INFO L225 Difference]: With dead ends: 478999 [2024-11-11 21:16:26,735 INFO L226 Difference]: Without dead ends: 456283 [2024-11-11 21:16:26,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27334 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=8390, Invalid=57402, Unknown=0, NotChecked=0, Total=65792 [2024-11-11 21:16:26,856 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 6392 mSDsluCounter, 4254 mSDsCounter, 0 mSdLazyCounter, 5406 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6392 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 5562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 5406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:26,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6392 Valid, 4543 Invalid, 5562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 5406 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 21:16:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456283 states. [2024-11-11 21:16:35,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456283 to 233837. [2024-11-11 21:16:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233837 states, 233836 states have (on average 1.3328871516789544) internal successors, (311677), 233836 states have internal predecessors, (311677), 0 states have call successors, (0), 0 states 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 21:16:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233837 states to 233837 states and 311677 transitions. [2024-11-11 21:16:36,153 INFO L78 Accepts]: Start accepts. Automaton has 233837 states and 311677 transitions. Word has length 83 [2024-11-11 21:16:36,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:36,154 INFO L471 AbstractCegarLoop]: Abstraction has 233837 states and 311677 transitions. [2024-11-11 21:16:36,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.371428571428571) internal successors, (223), 35 states have internal predecessors, (223), 0 states have call successors, (0), 0 states 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 21:16:36,154 INFO L276 IsEmpty]: Start isEmpty. Operand 233837 states and 311677 transitions. [2024-11-11 21:16:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-11 21:16:36,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:36,158 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:16:36,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 21:16:36,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:16:36,361 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:36,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:36,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1949500802, now seen corresponding path program 1 times [2024-11-11 21:16:36,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:36,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37914583] [2024-11-11 21:16:36,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:36,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:36,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:36,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37914583] [2024-11-11 21:16:36,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37914583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:36,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:36,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:36,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904210281] [2024-11-11 21:16:36,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:36,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:36,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:36,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:36,433 INFO L87 Difference]: Start difference. First operand 233837 states and 311677 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)