./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.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 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:22:19,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:22:19,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:22:19,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:22:19,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:22:19,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:22:19,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:22:19,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:22:19,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:22:19,305 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:22:19,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:22:19,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:22:19,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:22:19,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:22:19,306 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:22:19,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:22:19,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:22:19,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:22:19,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:22:19,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:22:19,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:22:19,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:22:19,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:22:19,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:22:19,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:22:19,309 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:22:19,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:22:19,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:22:19,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:22:19,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:22:19,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:22:19,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:22:19,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:22:19,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:22:19,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:22:19,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:22:19,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:22:19,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:22:19,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:22:19,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:22:19,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:22:19,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:22:19,313 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 -> 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b [2024-10-24 01:22:19,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:22:19,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:22:19,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:22:19,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:22:19,513 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:22:19,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2024-10-24 01:22:20,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:22:20,947 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:22:20,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2024-10-24 01:22:20,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed4f4d53/7bd9975ceb7e480d97a769c087243068/FLAG5eaad0897 [2024-10-24 01:22:21,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed4f4d53/7bd9975ceb7e480d97a769c087243068 [2024-10-24 01:22:21,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:22:21,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:22:21,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:22:21,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:22:21,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:22:21,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:22:21" (1/1) ... [2024-10-24 01:22:21,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c95998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21, skipping insertion in model container [2024-10-24 01:22:21,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:22:21" (1/1) ... [2024-10-24 01:22:21,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:22:21,565 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2024-10-24 01:22:21,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:22:21,578 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:22:21,608 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2024-10-24 01:22:21,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:22:21,627 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:22:21,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21 WrapperNode [2024-10-24 01:22:21,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:22:21,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:22:21,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:22:21,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:22:21,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21" (1/1) ... [2024-10-24 01:22:21,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21" (1/1) ... [2024-10-24 01:22:21,665 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2024-10-24 01:22:21,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:22:21,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:22:21,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:22:21,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:22:21,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21" (1/1) ... [2024-10-24 01:22:21,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21" (1/1) ... [2024-10-24 01:22:21,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21" (1/1) ... [2024-10-24 01:22:21,689 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 01:22:21,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21" (1/1) ... [2024-10-24 01:22:21,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21" (1/1) ... [2024-10-24 01:22:21,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21" (1/1) ... [2024-10-24 01:22:21,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21" (1/1) ... [2024-10-24 01:22:21,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21" (1/1) ... [2024-10-24 01:22:21,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21" (1/1) ... [2024-10-24 01:22:21,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:22:21,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:22:21,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:22:21,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:22:21,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21" (1/1) ... [2024-10-24 01:22:21,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:22:21,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:22:21,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:22:21,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:22:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:22:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:22:21,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:22:21,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:22:21,903 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:22:21,905 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:22:22,218 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-24 01:22:22,218 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:22:22,252 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:22:22,252 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 01:22:22,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:22:22 BoogieIcfgContainer [2024-10-24 01:22:22,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:22:22,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:22:22,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:22:22,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:22:22,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:22:21" (1/3) ... [2024-10-24 01:22:22,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f9fcce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:22:22, skipping insertion in model container [2024-10-24 01:22:22,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:22:21" (2/3) ... [2024-10-24 01:22:22,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f9fcce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:22:22, skipping insertion in model container [2024-10-24 01:22:22,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:22:22" (3/3) ... [2024-10-24 01:22:22,260 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2024-10-24 01:22:22,272 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:22:22,272 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:22:22,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:22:22,317 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;@67f2ae46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:22:22,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:22:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.7666666666666666) internal successors, (106), 61 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 01:22:22,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:22,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:22:22,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:22,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1479912418, now seen corresponding path program 1 times [2024-10-24 01:22:22,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:22,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32098148] [2024-10-24 01:22:22,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:22,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:22,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:22,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32098148] [2024-10-24 01:22:22,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32098148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:22:22,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:22:22,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:22:22,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624003495] [2024-10-24 01:22:22,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:22:22,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:22:22,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:22,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:22:22,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:22:22,673 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.7666666666666666) internal successors, (106), 61 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:22,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:22,752 INFO L93 Difference]: Finished difference Result 145 states and 243 transitions. [2024-10-24 01:22:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:22:22,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-24 01:22:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:22,760 INFO L225 Difference]: With dead ends: 145 [2024-10-24 01:22:22,760 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 01:22:22,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:22:22,766 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 62 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:22:22,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 270 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:22:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 01:22:22,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 60. [2024-10-24 01:22:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 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) [2024-10-24 01:22:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2024-10-24 01:22:22,799 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 22 [2024-10-24 01:22:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:22,800 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2024-10-24 01:22:22,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2024-10-24 01:22:22,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 01:22:22,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:22,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:22:22,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:22:22,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:22,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:22,803 INFO L85 PathProgramCache]: Analyzing trace with hash -781461804, now seen corresponding path program 1 times [2024-10-24 01:22:22,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:22,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570587848] [2024-10-24 01:22:22,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:22,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:22,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:22,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570587848] [2024-10-24 01:22:22,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570587848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:22:22,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:22:22,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:22:22,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344819605] [2024-10-24 01:22:22,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:22:23,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:22:23,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:23,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:22:23,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:22:23,003 INFO L87 Difference]: Start difference. First operand 60 states and 84 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:23,094 INFO L93 Difference]: Finished difference Result 216 states and 336 transitions. [2024-10-24 01:22:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:22:23,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-24 01:22:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:23,097 INFO L225 Difference]: With dead ends: 216 [2024-10-24 01:22:23,097 INFO L226 Difference]: Without dead ends: 177 [2024-10-24 01:22:23,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:22:23,099 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 354 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:22:23,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 311 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:22:23,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-24 01:22:23,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2024-10-24 01:22:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.5) internal successors, (144), 96 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-10-24 01:22:23,122 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 38 [2024-10-24 01:22:23,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:23,123 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-10-24 01:22:23,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-10-24 01:22:23,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 01:22:23,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:23,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:22:23,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:22:23,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:23,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:23,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1531456910, now seen corresponding path program 1 times [2024-10-24 01:22:23,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:23,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410076111] [2024-10-24 01:22:23,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:23,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:23,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410076111] [2024-10-24 01:22:23,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410076111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:22:23,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:22:23,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:22:23,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997646123] [2024-10-24 01:22:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:22:23,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:22:23,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:23,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:22:23,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:22:23,312 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:23,341 INFO L93 Difference]: Finished difference Result 103 states and 151 transitions. [2024-10-24 01:22:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:22:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-24 01:22:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:23,343 INFO L225 Difference]: With dead ends: 103 [2024-10-24 01:22:23,343 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 01:22:23,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:22:23,344 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:22:23,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:22:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 01:22:23,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 01:22:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.48) internal successors, (148), 100 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions. [2024-10-24 01:22:23,350 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 39 [2024-10-24 01:22:23,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:23,351 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions. [2024-10-24 01:22:23,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions. [2024-10-24 01:22:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 01:22:23,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:23,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:22:23,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:22:23,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:23,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:23,353 INFO L85 PathProgramCache]: Analyzing trace with hash 231554364, now seen corresponding path program 1 times [2024-10-24 01:22:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:23,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868254226] [2024-10-24 01:22:23,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:23,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:23,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:23,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868254226] [2024-10-24 01:22:23,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868254226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:22:23,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:22:23,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:22:23,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221646349] [2024-10-24 01:22:23,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:22:23,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:22:23,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:23,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:22:23,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:23,420 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:23,436 INFO L93 Difference]: Finished difference Result 247 states and 378 transitions. [2024-10-24 01:22:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:22:23,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-24 01:22:23,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:23,440 INFO L225 Difference]: With dead ends: 247 [2024-10-24 01:22:23,440 INFO L226 Difference]: Without dead ends: 167 [2024-10-24 01:22:23,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:23,441 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 36 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:22:23,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 140 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:22:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-24 01:22:23,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2024-10-24 01:22:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 164 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2024-10-24 01:22:23,457 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 40 [2024-10-24 01:22:23,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:23,458 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2024-10-24 01:22:23,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2024-10-24 01:22:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 01:22:23,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:23,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:22:23,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:22:23,459 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:23,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1940057635, now seen corresponding path program 1 times [2024-10-24 01:22:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175340497] [2024-10-24 01:22:23,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:23,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:23,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:23,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175340497] [2024-10-24 01:22:23,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175340497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:22:23,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:22:23,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:22:23,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373530604] [2024-10-24 01:22:23,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:22:23,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:22:23,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:23,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:22:23,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:23,518 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:23,540 INFO L93 Difference]: Finished difference Result 311 states and 477 transitions. [2024-10-24 01:22:23,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:22:23,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-24 01:22:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:23,541 INFO L225 Difference]: With dead ends: 311 [2024-10-24 01:22:23,541 INFO L226 Difference]: Without dead ends: 231 [2024-10-24 01:22:23,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:23,542 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 51 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 181 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-10-24 01:22:23,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 181 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:22:23,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-24 01:22:23,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2024-10-24 01:22:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.5175438596491229) internal successors, (346), 228 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 346 transitions. [2024-10-24 01:22:23,557 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 346 transitions. Word has length 40 [2024-10-24 01:22:23,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:23,557 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 346 transitions. [2024-10-24 01:22:23,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 346 transitions. [2024-10-24 01:22:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-24 01:22:23,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:23,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:22:23,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:22:23,561 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:23,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:23,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1445773387, now seen corresponding path program 1 times [2024-10-24 01:22:23,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:23,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214769376] [2024-10-24 01:22:23,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:23,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:23,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:23,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214769376] [2024-10-24 01:22:23,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214769376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:22:23,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:22:23,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:22:23,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390796077] [2024-10-24 01:22:23,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:22:23,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:22:23,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:23,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:22:23,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:23,606 INFO L87 Difference]: Start difference. First operand 229 states and 346 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:23,626 INFO L93 Difference]: Finished difference Result 593 states and 908 transitions. [2024-10-24 01:22:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:22:23,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-10-24 01:22:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:23,630 INFO L225 Difference]: With dead ends: 593 [2024-10-24 01:22:23,630 INFO L226 Difference]: Without dead ends: 387 [2024-10-24 01:22:23,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:23,631 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 168 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-10-24 01:22:23,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 168 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:22:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-24 01:22:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2024-10-24 01:22:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.5052083333333333) internal successors, (578), 384 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 578 transitions. [2024-10-24 01:22:23,667 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 578 transitions. Word has length 41 [2024-10-24 01:22:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:23,668 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 578 transitions. [2024-10-24 01:22:23,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 578 transitions. [2024-10-24 01:22:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-24 01:22:23,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:23,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:22:23,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:22:23,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:23,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:23,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1919502123, now seen corresponding path program 1 times [2024-10-24 01:22:23,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:23,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243411950] [2024-10-24 01:22:23,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:23,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:23,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:23,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243411950] [2024-10-24 01:22:23,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243411950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:22:23,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:22:23,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:22:23,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928104063] [2024-10-24 01:22:23,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:22:23,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:22:23,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:23,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:22:23,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:23,721 INFO L87 Difference]: Start difference. First operand 385 states and 578 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:23,746 INFO L93 Difference]: Finished difference Result 1013 states and 1520 transitions. [2024-10-24 01:22:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:22:23,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-10-24 01:22:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:23,749 INFO L225 Difference]: With dead ends: 1013 [2024-10-24 01:22:23,749 INFO L226 Difference]: Without dead ends: 651 [2024-10-24 01:22:23,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:23,753 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 47 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 181 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-10-24 01:22:23,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 181 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:22:23,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-10-24 01:22:23,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2024-10-24 01:22:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.4691358024691359) internal successors, (952), 648 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 952 transitions. [2024-10-24 01:22:23,773 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 952 transitions. Word has length 41 [2024-10-24 01:22:23,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:23,773 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 952 transitions. [2024-10-24 01:22:23,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 952 transitions. [2024-10-24 01:22:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 01:22:23,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:23,776 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:22:23,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:22:23,776 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:23,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:23,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1974468253, now seen corresponding path program 1 times [2024-10-24 01:22:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:23,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43050735] [2024-10-24 01:22:23,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:23,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:23,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:23,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43050735] [2024-10-24 01:22:23,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43050735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:22:23,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:22:23,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:22:23,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100922319] [2024-10-24 01:22:23,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:22:23,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:22:23,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:23,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:22:23,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:23,878 INFO L87 Difference]: Start difference. First operand 649 states and 952 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:23,903 INFO L93 Difference]: Finished difference Result 1277 states and 1882 transitions. [2024-10-24 01:22:23,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:22:23,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-24 01:22:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:23,906 INFO L225 Difference]: With dead ends: 1277 [2024-10-24 01:22:23,906 INFO L226 Difference]: Without dead ends: 651 [2024-10-24 01:22:23,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:23,909 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 41 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:22:23,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 172 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:22:23,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-10-24 01:22:23,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2024-10-24 01:22:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.4506172839506173) internal successors, (940), 648 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 940 transitions. [2024-10-24 01:22:23,928 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 940 transitions. Word has length 58 [2024-10-24 01:22:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:23,929 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 940 transitions. [2024-10-24 01:22:23,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 940 transitions. [2024-10-24 01:22:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 01:22:23,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:23,930 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:22:23,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:22:23,930 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:23,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:23,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1468182908, now seen corresponding path program 1 times [2024-10-24 01:22:23,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:23,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535998658] [2024-10-24 01:22:23,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:24,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:24,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535998658] [2024-10-24 01:22:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535998658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:22:24,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:22:24,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:22:24,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064387137] [2024-10-24 01:22:24,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:22:24,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:22:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:24,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:22:24,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:24,055 INFO L87 Difference]: Start difference. First operand 649 states and 940 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:24,077 INFO L93 Difference]: Finished difference Result 965 states and 1400 transitions. [2024-10-24 01:22:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:22:24,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-24 01:22:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:24,080 INFO L225 Difference]: With dead ends: 965 [2024-10-24 01:22:24,080 INFO L226 Difference]: Without dead ends: 339 [2024-10-24 01:22:24,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:24,081 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 35 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:22:24,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 153 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:22:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-24 01:22:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2024-10-24 01:22:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 1.4166666666666667) internal successors, (476), 336 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 476 transitions. [2024-10-24 01:22:24,094 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 476 transitions. Word has length 58 [2024-10-24 01:22:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:24,095 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 476 transitions. [2024-10-24 01:22:24,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 476 transitions. [2024-10-24 01:22:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 01:22:24,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:24,096 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:22:24,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:22:24,097 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:24,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:24,097 INFO L85 PathProgramCache]: Analyzing trace with hash 483939365, now seen corresponding path program 1 times [2024-10-24 01:22:24,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:24,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661071959] [2024-10-24 01:22:24,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:24,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:22:24,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:24,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661071959] [2024-10-24 01:22:24,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661071959] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:22:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340176526] [2024-10-24 01:22:24,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:24,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:22:24,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:22:24,245 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-10-24 01:22:24,246 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-10-24 01:22:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:24,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 01:22:24,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:22:24,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:24,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:22:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:25,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340176526] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:22:25,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:22:25,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 17 [2024-10-24 01:22:25,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892365016] [2024-10-24 01:22:25,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:22:25,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 01:22:25,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:25,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 01:22:25,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:22:25,404 INFO L87 Difference]: Start difference. First operand 337 states and 476 transitions. Second operand has 17 states, 17 states have (on average 9.647058823529411) internal successors, (164), 17 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:26,298 INFO L93 Difference]: Finished difference Result 1784 states and 2495 transitions. [2024-10-24 01:22:26,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 01:22:26,298 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.647058823529411) internal successors, (164), 17 states have internal predecessors, (164), 0 states have call successors, (0), 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 58 [2024-10-24 01:22:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:26,303 INFO L225 Difference]: With dead ends: 1784 [2024-10-24 01:22:26,303 INFO L226 Difference]: Without dead ends: 1470 [2024-10-24 01:22:26,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=371, Invalid=889, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 01:22:26,305 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1335 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:22:26,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 867 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:22:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2024-10-24 01:22:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1322. [2024-10-24 01:22:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1321 states have (on average 1.3875851627554883) internal successors, (1833), 1321 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1833 transitions. [2024-10-24 01:22:26,347 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1833 transitions. Word has length 58 [2024-10-24 01:22:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:26,347 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 1833 transitions. [2024-10-24 01:22:26,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.647058823529411) internal successors, (164), 17 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1833 transitions. [2024-10-24 01:22:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 01:22:26,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:26,349 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:22:26,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 01:22:26,552 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,SelfDestructingSolverStorable9 [2024-10-24 01:22:26,553 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:26,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:26,554 INFO L85 PathProgramCache]: Analyzing trace with hash -171590031, now seen corresponding path program 1 times [2024-10-24 01:22:26,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:26,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371471631] [2024-10-24 01:22:26,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:26,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:22:26,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371471631] [2024-10-24 01:22:26,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371471631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:22:26,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:22:26,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:22:26,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107440931] [2024-10-24 01:22:26,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:22:26,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:22:26,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:26,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:22:26,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:22:26,633 INFO L87 Difference]: Start difference. First operand 1322 states and 1833 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:26,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:26,708 INFO L93 Difference]: Finished difference Result 3256 states and 4571 transitions. [2024-10-24 01:22:26,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:22:26,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-24 01:22:26,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:26,716 INFO L225 Difference]: With dead ends: 3256 [2024-10-24 01:22:26,716 INFO L226 Difference]: Without dead ends: 2607 [2024-10-24 01:22:26,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:22:26,717 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 212 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:22:26,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 352 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:22:26,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2024-10-24 01:22:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 1948. [2024-10-24 01:22:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1947 states have (on average 1.3810991268618387) internal successors, (2689), 1947 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:26,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2689 transitions. [2024-10-24 01:22:26,816 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2689 transitions. Word has length 59 [2024-10-24 01:22:26,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:26,817 INFO L471 AbstractCegarLoop]: Abstraction has 1948 states and 2689 transitions. [2024-10-24 01:22:26,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2689 transitions. [2024-10-24 01:22:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 01:22:26,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:26,818 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:22:26,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:22:26,818 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:26,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1696946029, now seen corresponding path program 1 times [2024-10-24 01:22:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:26,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998220130] [2024-10-24 01:22:26,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 01:22:26,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:26,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998220130] [2024-10-24 01:22:26,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998220130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:22:26,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:22:26,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:22:26,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510364022] [2024-10-24 01:22:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:22:26,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:22:26,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:26,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:22:26,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:22:26,905 INFO L87 Difference]: Start difference. First operand 1948 states and 2689 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-10-24 01:22:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:26,995 INFO L93 Difference]: Finished difference Result 3882 states and 5427 transitions. [2024-10-24 01:22:26,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:22:26,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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 59 [2024-10-24 01:22:26,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:27,005 INFO L225 Difference]: With dead ends: 3882 [2024-10-24 01:22:27,005 INFO L226 Difference]: Without dead ends: 3233 [2024-10-24 01:22:27,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:22:27,008 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 218 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:22:27,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 358 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:22:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2024-10-24 01:22:27,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 2567. [2024-10-24 01:22:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2567 states, 2566 states have (on average 1.377240841777085) internal successors, (3534), 2566 states have internal predecessors, (3534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 3534 transitions. [2024-10-24 01:22:27,096 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 3534 transitions. Word has length 59 [2024-10-24 01:22:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:27,097 INFO L471 AbstractCegarLoop]: Abstraction has 2567 states and 3534 transitions. [2024-10-24 01:22:27,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-10-24 01:22:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 3534 transitions. [2024-10-24 01:22:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 01:22:27,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:27,098 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:22:27,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:22:27,098 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:27,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:27,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1973521553, now seen corresponding path program 1 times [2024-10-24 01:22:27,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:27,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975290272] [2024-10-24 01:22:27,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:27,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:22:27,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:27,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975290272] [2024-10-24 01:22:27,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975290272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:22:27,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:22:27,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:22:27,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824899116] [2024-10-24 01:22:27,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:22:27,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:22:27,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:27,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:22:27,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:22:27,176 INFO L87 Difference]: Start difference. First operand 2567 states and 3534 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:27,263 INFO L93 Difference]: Finished difference Result 4501 states and 6272 transitions. [2024-10-24 01:22:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:22:27,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-24 01:22:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:27,274 INFO L225 Difference]: With dead ends: 4501 [2024-10-24 01:22:27,275 INFO L226 Difference]: Without dead ends: 3852 [2024-10-24 01:22:27,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:22:27,277 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 216 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:22:27,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 385 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:22:27,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3852 states. [2024-10-24 01:22:27,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3852 to 3193. [2024-10-24 01:22:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3192 states have (on average 1.3753132832080202) internal successors, (4390), 3192 states have internal predecessors, (4390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4390 transitions. [2024-10-24 01:22:27,387 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4390 transitions. Word has length 59 [2024-10-24 01:22:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:27,388 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4390 transitions. [2024-10-24 01:22:27,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4390 transitions. [2024-10-24 01:22:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-24 01:22:27,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:27,389 INFO L215 NwaCegarLoop]: trace histogram [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-10-24 01:22:27,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:22:27,389 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:27,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash -853694343, now seen corresponding path program 1 times [2024-10-24 01:22:27,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:27,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896927343] [2024-10-24 01:22:27,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:27,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:27,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:27,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896927343] [2024-10-24 01:22:27,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896927343] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:22:27,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638369202] [2024-10-24 01:22:27,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:27,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:22:27,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:22:27,716 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-10-24 01:22:27,718 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-10-24 01:22:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:27,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 01:22:27,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:22:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:28,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:22:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:28,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638369202] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:22:28,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:22:28,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 27 [2024-10-24 01:22:28,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116760767] [2024-10-24 01:22:28,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:22:28,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-24 01:22:28,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:28,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-24 01:22:28,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2024-10-24 01:22:28,931 INFO L87 Difference]: Start difference. First operand 3193 states and 4390 transitions. Second operand has 28 states, 28 states have (on average 5.571428571428571) internal successors, (156), 27 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:29,600 INFO L93 Difference]: Finished difference Result 12362 states and 17156 transitions. [2024-10-24 01:22:29,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 01:22:29,601 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.571428571428571) internal successors, (156), 27 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-24 01:22:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:29,641 INFO L225 Difference]: With dead ends: 12362 [2024-10-24 01:22:29,641 INFO L226 Difference]: Without dead ends: 9194 [2024-10-24 01:22:29,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=433, Invalid=1373, Unknown=0, NotChecked=0, Total=1806 [2024-10-24 01:22:29,645 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1297 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:22:29,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 655 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:22:29,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9194 states. [2024-10-24 01:22:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9194 to 6612. [2024-10-24 01:22:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6612 states, 6611 states have (on average 1.3562244743609135) internal successors, (8966), 6611 states have internal predecessors, (8966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6612 states to 6612 states and 8966 transitions. [2024-10-24 01:22:29,809 INFO L78 Accepts]: Start accepts. Automaton has 6612 states and 8966 transitions. Word has length 62 [2024-10-24 01:22:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:29,810 INFO L471 AbstractCegarLoop]: Abstraction has 6612 states and 8966 transitions. [2024-10-24 01:22:29,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.571428571428571) internal successors, (156), 27 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 6612 states and 8966 transitions. [2024-10-24 01:22:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-24 01:22:29,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:29,811 INFO L215 NwaCegarLoop]: trace histogram [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-10-24 01:22:29,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 01:22:30,011 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,SelfDestructingSolverStorable13 [2024-10-24 01:22:30,012 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:30,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:30,013 INFO L85 PathProgramCache]: Analyzing trace with hash -229194629, now seen corresponding path program 1 times [2024-10-24 01:22:30,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:30,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683834748] [2024-10-24 01:22:30,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:30,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:30,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:30,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683834748] [2024-10-24 01:22:30,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683834748] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:22:30,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667902808] [2024-10-24 01:22:30,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:30,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:22:30,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:22:30,282 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-10-24 01:22:30,284 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-10-24 01:22:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:30,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 01:22:30,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:22:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:30,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:22:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:31,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667902808] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:22:31,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:22:31,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2024-10-24 01:22:31,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844790986] [2024-10-24 01:22:31,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:22:31,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-24 01:22:31,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:31,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-24 01:22:31,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2024-10-24 01:22:31,613 INFO L87 Difference]: Start difference. First operand 6612 states and 8966 transitions. Second operand has 29 states, 29 states have (on average 5.862068965517241) internal successors, (170), 28 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:38,311 INFO L93 Difference]: Finished difference Result 45133 states and 61250 transitions. [2024-10-24 01:22:38,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2024-10-24 01:22:38,311 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.862068965517241) internal successors, (170), 28 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-24 01:22:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:38,375 INFO L225 Difference]: With dead ends: 45133 [2024-10-24 01:22:38,375 INFO L226 Difference]: Without dead ends: 38664 [2024-10-24 01:22:38,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11688 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5209, Invalid=25241, Unknown=0, NotChecked=0, Total=30450 [2024-10-24 01:22:38,391 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 5767 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5767 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:22:38,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5767 Valid, 1672 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 01:22:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38664 states. [2024-10-24 01:22:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38664 to 26654. [2024-10-24 01:22:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26654 states, 26653 states have (on average 1.3497542490526395) internal successors, (35975), 26653 states have internal predecessors, (35975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26654 states to 26654 states and 35975 transitions. [2024-10-24 01:22:39,216 INFO L78 Accepts]: Start accepts. Automaton has 26654 states and 35975 transitions. Word has length 62 [2024-10-24 01:22:39,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:39,216 INFO L471 AbstractCegarLoop]: Abstraction has 26654 states and 35975 transitions. [2024-10-24 01:22:39,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.862068965517241) internal successors, (170), 28 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 26654 states and 35975 transitions. [2024-10-24 01:22:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 01:22:39,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:39,218 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:22:39,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 01:22:39,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:22:39,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:39,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:39,420 INFO L85 PathProgramCache]: Analyzing trace with hash -322972731, now seen corresponding path program 1 times [2024-10-24 01:22:39,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:39,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916084879] [2024-10-24 01:22:39,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:39,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:39,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:39,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916084879] [2024-10-24 01:22:39,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916084879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:22:39,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:22:39,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:22:39,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605716909] [2024-10-24 01:22:39,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:22:39,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:22:39,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:39,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:22:39,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:39,453 INFO L87 Difference]: Start difference. First operand 26654 states and 35975 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:40,438 INFO L93 Difference]: Finished difference Result 68558 states and 91950 transitions. [2024-10-24 01:22:40,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:22:40,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-24 01:22:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:40,501 INFO L225 Difference]: With dead ends: 68558 [2024-10-24 01:22:40,501 INFO L226 Difference]: Without dead ends: 42113 [2024-10-24 01:22:40,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:40,531 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:22:40,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 163 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:22:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42113 states. [2024-10-24 01:22:41,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42113 to 42111. [2024-10-24 01:22:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42111 states, 42110 states have (on average 1.3146995962954167) internal successors, (55362), 42110 states have internal predecessors, (55362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42111 states to 42111 states and 55362 transitions. [2024-10-24 01:22:41,579 INFO L78 Accepts]: Start accepts. Automaton has 42111 states and 55362 transitions. Word has length 63 [2024-10-24 01:22:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:41,579 INFO L471 AbstractCegarLoop]: Abstraction has 42111 states and 55362 transitions. [2024-10-24 01:22:41,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 42111 states and 55362 transitions. [2024-10-24 01:22:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 01:22:41,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:41,581 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:22:41,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:22:41,581 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:41,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:41,581 INFO L85 PathProgramCache]: Analyzing trace with hash 678947077, now seen corresponding path program 1 times [2024-10-24 01:22:41,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:41,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111864782] [2024-10-24 01:22:41,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:41,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:41,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:41,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111864782] [2024-10-24 01:22:41,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111864782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:22:41,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:22:41,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:22:41,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343971648] [2024-10-24 01:22:41,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:22:41,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:22:41,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:41,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:22:41,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:41,612 INFO L87 Difference]: Start difference. First operand 42111 states and 55362 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:22:42,669 INFO L93 Difference]: Finished difference Result 88892 states and 116845 transitions. [2024-10-24 01:22:42,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:22:42,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-24 01:22:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:22:42,728 INFO L225 Difference]: With dead ends: 88892 [2024-10-24 01:22:42,728 INFO L226 Difference]: Without dead ends: 46969 [2024-10-24 01:22:42,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:22:42,757 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 36 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:22:42,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 194 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:22:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46969 states. [2024-10-24 01:22:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46969 to 37307. [2024-10-24 01:22:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37307 states, 37306 states have (on average 1.2994692542754516) internal successors, (48478), 37306 states have internal predecessors, (48478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37307 states to 37307 states and 48478 transitions. [2024-10-24 01:22:43,958 INFO L78 Accepts]: Start accepts. Automaton has 37307 states and 48478 transitions. Word has length 63 [2024-10-24 01:22:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:22:43,958 INFO L471 AbstractCegarLoop]: Abstraction has 37307 states and 48478 transitions. [2024-10-24 01:22:43,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:22:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 37307 states and 48478 transitions. [2024-10-24 01:22:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 01:22:43,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:22:43,959 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 01:22:43,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:22:43,960 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:22:43,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:22:43,960 INFO L85 PathProgramCache]: Analyzing trace with hash 165523273, now seen corresponding path program 1 times [2024-10-24 01:22:43,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:22:43,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131128014] [2024-10-24 01:22:43,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:43,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:22:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:44,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:22:44,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131128014] [2024-10-24 01:22:44,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131128014] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:22:44,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42367153] [2024-10-24 01:22:44,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:22:44,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:22:44,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:22:44,388 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:22:44,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 01:22:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:22:44,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-24 01:22:44,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:22:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:47,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:22:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:22:48,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42367153] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:22:48,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:22:48,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 15] total 38 [2024-10-24 01:22:48,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691845456] [2024-10-24 01:22:48,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:22:48,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-24 01:22:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:22:48,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-24 01:22:48,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2024-10-24 01:22:48,998 INFO L87 Difference]: Start difference. First operand 37307 states and 48478 transitions. Second operand has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 38 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:23:09,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:23:09,312 INFO L93 Difference]: Finished difference Result 332858 states and 431638 transitions. [2024-10-24 01:23:09,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2024-10-24 01:23:09,313 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 38 states have internal predecessors, (173), 0 states have call successors, (0), 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 64 [2024-10-24 01:23:09,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:23:09,719 INFO L225 Difference]: With dead ends: 332858 [2024-10-24 01:23:09,719 INFO L226 Difference]: Without dead ends: 295606 [2024-10-24 01:23:09,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9967 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=5150, Invalid=22240, Unknown=0, NotChecked=0, Total=27390 [2024-10-24 01:23:09,786 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 3486 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 3583 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3486 SdHoareTripleChecker+Valid, 2585 SdHoareTripleChecker+Invalid, 3679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 3583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:23:09,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3486 Valid, 2585 Invalid, 3679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 3583 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 01:23:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295606 states. [2024-10-24 01:23:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295606 to 96090. [2024-10-24 01:23:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96090 states, 96089 states have (on average 1.3079853052898875) internal successors, (125683), 96089 states have internal predecessors, (125683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:23:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96090 states to 96090 states and 125683 transitions. [2024-10-24 01:23:15,349 INFO L78 Accepts]: Start accepts. Automaton has 96090 states and 125683 transitions. Word has length 64 [2024-10-24 01:23:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:23:15,349 INFO L471 AbstractCegarLoop]: Abstraction has 96090 states and 125683 transitions. [2024-10-24 01:23:15,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 38 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:23:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 96090 states and 125683 transitions. [2024-10-24 01:23:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 01:23:15,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:23:15,364 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:23:15,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 01:23:15,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-24 01:23:15,569 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:23:15,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:23:15,569 INFO L85 PathProgramCache]: Analyzing trace with hash 558402980, now seen corresponding path program 1 times [2024-10-24 01:23:15,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:23:15,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031456203] [2024-10-24 01:23:15,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:23:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:23:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:23:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 01:23:15,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:23:15,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031456203] [2024-10-24 01:23:15,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031456203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:23:15,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:23:15,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:23:15,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791799461] [2024-10-24 01:23:15,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:23:15,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:23:15,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:23:15,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:23:15,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:23:15,629 INFO L87 Difference]: Start difference. First operand 96090 states and 125683 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:23:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:23:18,439 INFO L93 Difference]: Finished difference Result 115439 states and 150351 transitions. [2024-10-24 01:23:18,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:23:18,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 101 [2024-10-24 01:23:18,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:23:18,551 INFO L225 Difference]: With dead ends: 115439 [2024-10-24 01:23:18,551 INFO L226 Difference]: Without dead ends: 77906 [2024-10-24 01:23:18,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:23:18,580 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 27 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:23:18,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 157 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:23:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77906 states. [2024-10-24 01:23:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77906 to 77904. [2024-10-24 01:23:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77904 states, 77903 states have (on average 1.2837888142946998) internal successors, (100011), 77903 states have internal predecessors, (100011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:23:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77904 states to 77904 states and 100011 transitions. [2024-10-24 01:23:22,224 INFO L78 Accepts]: Start accepts. Automaton has 77904 states and 100011 transitions. Word has length 101 [2024-10-24 01:23:22,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:23:22,225 INFO L471 AbstractCegarLoop]: Abstraction has 77904 states and 100011 transitions. [2024-10-24 01:23:22,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:23:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 77904 states and 100011 transitions. [2024-10-24 01:23:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 01:23:22,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:23:22,237 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:23:22,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:23:22,237 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:23:22,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:23:22,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1634728521, now seen corresponding path program 1 times [2024-10-24 01:23:22,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:23:22,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108190829] [2024-10-24 01:23:22,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:23:22,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:23:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:23:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 01:23:22,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:23:22,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108190829] [2024-10-24 01:23:22,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108190829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:23:22,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:23:22,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:23:22,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406062705] [2024-10-24 01:23:22,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:23:22,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:23:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:23:22,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:23:22,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:23:22,296 INFO L87 Difference]: Start difference. First operand 77904 states and 100011 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:23:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:23:24,720 INFO L93 Difference]: Finished difference Result 106815 states and 136513 transitions. [2024-10-24 01:23:24,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:23:24,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-10-24 01:23:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:23:24,791 INFO L225 Difference]: With dead ends: 106815 [2024-10-24 01:23:24,791 INFO L226 Difference]: Without dead ends: 68075 [2024-10-24 01:23:24,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:23:24,811 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 26 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:23:24,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 189 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:23:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68075 states. [2024-10-24 01:23:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68075 to 62107. [2024-10-24 01:23:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62107 states, 62106 states have (on average 1.260586738801404) internal successors, (78290), 62106 states have internal predecessors, (78290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:23:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62107 states to 62107 states and 78290 transitions. [2024-10-24 01:23:27,167 INFO L78 Accepts]: Start accepts. Automaton has 62107 states and 78290 transitions. Word has length 102 [2024-10-24 01:23:27,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:23:27,167 INFO L471 AbstractCegarLoop]: Abstraction has 62107 states and 78290 transitions. [2024-10-24 01:23:27,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:23:27,167 INFO L276 IsEmpty]: Start isEmpty. Operand 62107 states and 78290 transitions. [2024-10-24 01:23:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 01:23:27,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:23:27,174 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-24 01:23:27,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:23:27,174 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:23:27,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:23:27,175 INFO L85 PathProgramCache]: Analyzing trace with hash 315601911, now seen corresponding path program 1 times [2024-10-24 01:23:27,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:23:27,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185979903] [2024-10-24 01:23:27,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:23:27,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:23:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:23:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 01:23:27,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:23:27,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185979903] [2024-10-24 01:23:27,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185979903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:23:27,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:23:27,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:23:27,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34047203] [2024-10-24 01:23:27,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:23:27,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:23:27,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:23:27,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:23:27,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:23:27,228 INFO L87 Difference]: Start difference. First operand 62107 states and 78290 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)