./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2ebc8d28b42c51bdeaffef49b8259d7ab2c7e002b024bef1fa6cab620a98975e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:53:27,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:53:27,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:53:27,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:53:27,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:53:27,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:53:27,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:53:27,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:53:27,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:53:27,581 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:53:27,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:53:27,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:53:27,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:53:27,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:53:27,583 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:53:27,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:53:27,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:53:27,584 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:53:27,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:53:27,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:53:27,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:53:27,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:53:27,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:53:27,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:53:27,586 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:53:27,586 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:53:27,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:53:27,587 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:53:27,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:53:27,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:53:27,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:53:27,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:53:27,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:53:27,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:53:27,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:53:27,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:53:27,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:53:27,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:53:27,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:53:27,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:53:27,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:53:27,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:53:27,590 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-clean/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-clean/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 -> 2ebc8d28b42c51bdeaffef49b8259d7ab2c7e002b024bef1fa6cab620a98975e [2024-10-11 04:53:27,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:53:27,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:53:27,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:53:27,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:53:27,820 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:53:27,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-10-11 04:53:29,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:53:29,596 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:53:29,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-10-11 04:53:29,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ff5040dd/c1b9553a55894ac2aa2910b1370ca674/FLAGc670c8bd3 [2024-10-11 04:53:29,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ff5040dd/c1b9553a55894ac2aa2910b1370ca674 [2024-10-11 04:53:29,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:53:29,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:53:29,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:53:29,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:53:29,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:53:29,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:53:29" (1/1) ... [2024-10-11 04:53:29,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5d27c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:29, skipping insertion in model container [2024-10-11 04:53:29,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:53:29" (1/1) ... [2024-10-11 04:53:29,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:53:30,140 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c[15510,15523] [2024-10-11 04:53:30,160 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c[16352,16365] [2024-10-11 04:53:30,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:53:30,668 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:53:30,696 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c[15510,15523] [2024-10-11 04:53:30,700 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c[16352,16365] [2024-10-11 04:53:30,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:53:31,012 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:53:31,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:31 WrapperNode [2024-10-11 04:53:31,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:53:31,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:53:31,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:53:31,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:53:31,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:31" (1/1) ... [2024-10-11 04:53:31,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:31" (1/1) ... [2024-10-11 04:53:31,366 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5157 [2024-10-11 04:53:31,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:53:31,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:53:31,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:53:31,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:53:31,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:31" (1/1) ... [2024-10-11 04:53:31,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:31" (1/1) ... [2024-10-11 04:53:31,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:31" (1/1) ... [2024-10-11 04:53:31,536 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-11 04:53:31,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:31" (1/1) ... [2024-10-11 04:53:31,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:31" (1/1) ... [2024-10-11 04:53:31,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:31" (1/1) ... [2024-10-11 04:53:31,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:31" (1/1) ... [2024-10-11 04:53:31,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:31" (1/1) ... [2024-10-11 04:53:31,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:31" (1/1) ... [2024-10-11 04:53:31,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:53:31,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:53:31,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:53:31,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:53:31,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:31" (1/1) ... [2024-10-11 04:53:31,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:53:31,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:53:31,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:53:31,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:53:31,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:53:31,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:53:31,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:53:31,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:53:31,890 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:53:31,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:53:35,348 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2024-10-11 04:53:35,348 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:53:35,404 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:53:35,405 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:53:35,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:53:35 BoogieIcfgContainer [2024-10-11 04:53:35,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:53:35,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:53:35,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:53:35,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:53:35,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:53:29" (1/3) ... [2024-10-11 04:53:35,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8af92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:53:35, skipping insertion in model container [2024-10-11 04:53:35,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:31" (2/3) ... [2024-10-11 04:53:35,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8af92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:53:35, skipping insertion in model container [2024-10-11 04:53:35,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:53:35" (3/3) ... [2024-10-11 04:53:35,413 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label07.c [2024-10-11 04:53:35,427 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:53:35,428 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:53:35,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:53:35,501 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;@2c425ce2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:53:35,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:53:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 851 states, 848 states have (on average 1.9728773584905661) internal successors, (1673), 850 states have internal predecessors, (1673), 0 states have call successors, (0), 0 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-11 04:53:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 04:53:35,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:35,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 04:53:35,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:35,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:35,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1079698779, now seen corresponding path program 1 times [2024-10-11 04:53:35,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:35,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606606804] [2024-10-11 04:53:35,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:35,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:35,722 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-11 04:53:35,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:35,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606606804] [2024-10-11 04:53:35,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606606804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:35,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:35,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:53:35,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017496665] [2024-10-11 04:53:35,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:35,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:35,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:35,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:35,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:35,833 INFO L87 Difference]: Start difference. First operand has 851 states, 848 states have (on average 1.9728773584905661) internal successors, (1673), 850 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-11 04:53:38,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:38,975 INFO L93 Difference]: Finished difference Result 2411 states and 4760 transitions. [2024-10-11 04:53:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:38,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 04:53:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:39,006 INFO L225 Difference]: With dead ends: 2411 [2024-10-11 04:53:39,008 INFO L226 Difference]: Without dead ends: 1598 [2024-10-11 04:53:39,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:39,021 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 978 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:39,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 592 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 04:53:39,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2024-10-11 04:53:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2024-10-11 04:53:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1596 states have (on average 1.6472431077694236) internal successors, (2629), 1597 states have internal predecessors, (2629), 0 states have call successors, (0), 0 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-11 04:53:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2629 transitions. [2024-10-11 04:53:39,169 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2629 transitions. Word has length 6 [2024-10-11 04:53:39,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:39,169 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2629 transitions. [2024-10-11 04:53:39,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-11 04:53:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2629 transitions. [2024-10-11 04:53:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 04:53:39,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:39,171 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] [2024-10-11 04:53:39,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:53:39,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:39,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:39,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1430428717, now seen corresponding path program 1 times [2024-10-11 04:53:39,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:39,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567972828] [2024-10-11 04:53:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:39,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:39,309 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-11 04:53:39,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:39,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567972828] [2024-10-11 04:53:39,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567972828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:39,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:39,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:53:39,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409587445] [2024-10-11 04:53:39,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:39,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:53:39,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:39,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:53:39,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:53:39,315 INFO L87 Difference]: Start difference. First operand 1598 states and 2629 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-11 04:53:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:39,399 INFO L93 Difference]: Finished difference Result 1650 states and 2711 transitions. [2024-10-11 04:53:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:53:39,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-11 04:53:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:39,409 INFO L225 Difference]: With dead ends: 1650 [2024-10-11 04:53:39,410 INFO L226 Difference]: Without dead ends: 1598 [2024-10-11 04:53:39,411 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-11 04:53:39,412 INFO L432 NwaCegarLoop]: 1599 mSDtfsCounter, 0 mSDsluCounter, 3154 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4753 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:39,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4753 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2024-10-11 04:53:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2024-10-11 04:53:39,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1596 states have (on average 1.6221804511278195) internal successors, (2589), 1597 states have internal predecessors, (2589), 0 states have call successors, (0), 0 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-11 04:53:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2589 transitions. [2024-10-11 04:53:39,445 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2589 transitions. Word has length 23 [2024-10-11 04:53:39,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:39,446 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2589 transitions. [2024-10-11 04:53:39,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-11 04:53:39,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2589 transitions. [2024-10-11 04:53:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 04:53:39,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:39,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:53:39,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:53:39,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:39,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:39,454 INFO L85 PathProgramCache]: Analyzing trace with hash 270250855, now seen corresponding path program 1 times [2024-10-11 04:53:39,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:39,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058223512] [2024-10-11 04:53:39,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:39,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:39,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-11 04:53:39,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:39,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058223512] [2024-10-11 04:53:39,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058223512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:39,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:39,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:39,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675130538] [2024-10-11 04:53:39,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:39,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:39,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:39,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:39,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:39,727 INFO L87 Difference]: Start difference. First operand 1598 states and 2589 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-11 04:53:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:40,014 INFO L93 Difference]: Finished difference Result 2186 states and 3537 transitions. [2024-10-11 04:53:40,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:53:40,015 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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-11 04:53:40,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:40,022 INFO L225 Difference]: With dead ends: 2186 [2024-10-11 04:53:40,022 INFO L226 Difference]: Without dead ends: 2137 [2024-10-11 04:53:40,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:53:40,024 INFO L432 NwaCegarLoop]: 1553 mSDtfsCounter, 9829 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9829 SdHoareTripleChecker+Valid, 3039 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:40,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9829 Valid, 3039 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2024-10-11 04:53:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1645. [2024-10-11 04:53:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1643 states have (on average 1.6220328667072428) internal successors, (2665), 1644 states have internal predecessors, (2665), 0 states have call successors, (0), 0 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-11 04:53:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2665 transitions. [2024-10-11 04:53:40,057 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2665 transitions. Word has length 62 [2024-10-11 04:53:40,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:40,058 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2665 transitions. [2024-10-11 04:53:40,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-11 04:53:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2665 transitions. [2024-10-11 04:53:40,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 04:53:40,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:40,060 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, 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-11 04:53:40,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:53:40,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:40,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:40,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1880202711, now seen corresponding path program 1 times [2024-10-11 04:53:40,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:40,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696620906] [2024-10-11 04:53:40,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:40,226 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-11 04:53:40,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:40,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696620906] [2024-10-11 04:53:40,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696620906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:40,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:40,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:40,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690549861] [2024-10-11 04:53:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:40,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:40,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:40,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:40,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:40,232 INFO L87 Difference]: Start difference. First operand 1645 states and 2665 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-11 04:53:40,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:40,298 INFO L93 Difference]: Finished difference Result 1826 states and 2956 transitions. [2024-10-11 04:53:40,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:40,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-11 04:53:40,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:40,308 INFO L225 Difference]: With dead ends: 1826 [2024-10-11 04:53:40,312 INFO L226 Difference]: Without dead ends: 1730 [2024-10-11 04:53:40,313 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-11 04:53:40,314 INFO L432 NwaCegarLoop]: 1555 mSDtfsCounter, 1490 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:40,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1626 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2024-10-11 04:53:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1726. [2024-10-11 04:53:40,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.6200696055684454) internal successors, (2793), 1725 states have internal predecessors, (2793), 0 states have call successors, (0), 0 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-11 04:53:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2793 transitions. [2024-10-11 04:53:40,387 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2793 transitions. Word has length 64 [2024-10-11 04:53:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:40,388 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2793 transitions. [2024-10-11 04:53:40,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-11 04:53:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2793 transitions. [2024-10-11 04:53:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 04:53:40,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:40,389 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, 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-11 04:53:40,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:53:40,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:40,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:40,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1882347663, now seen corresponding path program 1 times [2024-10-11 04:53:40,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:40,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992654357] [2024-10-11 04:53:40,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:40,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:40,803 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-11 04:53:40,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:40,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992654357] [2024-10-11 04:53:40,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992654357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:40,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:40,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:40,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053408439] [2024-10-11 04:53:40,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:40,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:40,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:40,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:40,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:40,809 INFO L87 Difference]: Start difference. First operand 1726 states and 2793 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-11 04:53:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:41,034 INFO L93 Difference]: Finished difference Result 1905 states and 3077 transitions. [2024-10-11 04:53:41,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:41,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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-11 04:53:41,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:41,039 INFO L225 Difference]: With dead ends: 1905 [2024-10-11 04:53:41,040 INFO L226 Difference]: Without dead ends: 1728 [2024-10-11 04:53:41,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-10-11 04:53:41,041 INFO L432 NwaCegarLoop]: 1551 mSDtfsCounter, 3026 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3026 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:41,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3026 Valid, 1936 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2024-10-11 04:53:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1726. [2024-10-11 04:53:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.618909512761021) internal successors, (2791), 1725 states have internal predecessors, (2791), 0 states have call successors, (0), 0 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-11 04:53:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2791 transitions. [2024-10-11 04:53:41,068 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2791 transitions. Word has length 64 [2024-10-11 04:53:41,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:41,068 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2791 transitions. [2024-10-11 04:53:41,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-11 04:53:41,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2791 transitions. [2024-10-11 04:53:41,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 04:53:41,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:41,069 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, 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-11 04:53:41,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:53:41,070 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:41,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:41,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1905436323, now seen corresponding path program 1 times [2024-10-11 04:53:41,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:41,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113434432] [2024-10-11 04:53:41,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:41,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:41,205 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-11 04:53:41,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:41,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113434432] [2024-10-11 04:53:41,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113434432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:41,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:41,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:53:41,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687705546] [2024-10-11 04:53:41,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:41,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:53:41,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:41,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:53:41,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:53:41,207 INFO L87 Difference]: Start difference. First operand 1726 states and 2791 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 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-11 04:53:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:41,239 INFO L93 Difference]: Finished difference Result 1732 states and 2798 transitions. [2024-10-11 04:53:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:53:41,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-11 04:53:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:41,247 INFO L225 Difference]: With dead ends: 1732 [2024-10-11 04:53:41,247 INFO L226 Difference]: Without dead ends: 1730 [2024-10-11 04:53:41,248 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-11 04:53:41,248 INFO L432 NwaCegarLoop]: 1558 mSDtfsCounter, 0 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4666 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:41,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4666 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:41,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2024-10-11 04:53:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1730. [2024-10-11 04:53:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1728 states have (on average 1.6168981481481481) internal successors, (2794), 1729 states have internal predecessors, (2794), 0 states have call successors, (0), 0 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-11 04:53:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2794 transitions. [2024-10-11 04:53:41,281 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2794 transitions. Word has length 65 [2024-10-11 04:53:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:41,282 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2794 transitions. [2024-10-11 04:53:41,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 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-11 04:53:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2794 transitions. [2024-10-11 04:53:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:41,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:41,283 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, 1, 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-11 04:53:41,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:53:41,283 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:41,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:41,283 INFO L85 PathProgramCache]: Analyzing trace with hash -280645265, now seen corresponding path program 1 times [2024-10-11 04:53:41,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:41,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719174408] [2024-10-11 04:53:41,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:41,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:41,345 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-11 04:53:41,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:41,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719174408] [2024-10-11 04:53:41,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719174408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:41,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:41,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:41,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845875592] [2024-10-11 04:53:41,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:41,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:41,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:41,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:41,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:41,347 INFO L87 Difference]: Start difference. First operand 1730 states and 2794 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-11 04:53:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:41,379 INFO L93 Difference]: Finished difference Result 2076 states and 3334 transitions. [2024-10-11 04:53:41,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:41,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-11 04:53:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:41,385 INFO L225 Difference]: With dead ends: 2076 [2024-10-11 04:53:41,385 INFO L226 Difference]: Without dead ends: 1895 [2024-10-11 04:53:41,387 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-11 04:53:41,387 INFO L432 NwaCegarLoop]: 1604 mSDtfsCounter, 1503 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1691 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-11 04:53:41,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1691 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2024-10-11 04:53:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1893. [2024-10-11 04:53:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1891 states have (on average 1.6102591221575886) internal successors, (3045), 1892 states have internal predecessors, (3045), 0 states have call successors, (0), 0 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-11 04:53:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 3045 transitions. [2024-10-11 04:53:41,416 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 3045 transitions. Word has length 66 [2024-10-11 04:53:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:41,417 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 3045 transitions. [2024-10-11 04:53:41,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-11 04:53:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 3045 transitions. [2024-10-11 04:53:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:41,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:41,418 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, 1, 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-11 04:53:41,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:53:41,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:41,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash -240701329, now seen corresponding path program 1 times [2024-10-11 04:53:41,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:41,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392033325] [2024-10-11 04:53:41,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:41,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:41,488 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-11 04:53:41,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392033325] [2024-10-11 04:53:41,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392033325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:41,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:41,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:41,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888182025] [2024-10-11 04:53:41,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:41,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:41,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:41,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:41,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:41,490 INFO L87 Difference]: Start difference. First operand 1893 states and 3045 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-11 04:53:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:41,529 INFO L93 Difference]: Finished difference Result 2549 states and 4059 transitions. [2024-10-11 04:53:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:41,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-11 04:53:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:41,536 INFO L225 Difference]: With dead ends: 2549 [2024-10-11 04:53:41,537 INFO L226 Difference]: Without dead ends: 2205 [2024-10-11 04:53:41,538 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-11 04:53:41,539 INFO L432 NwaCegarLoop]: 1602 mSDtfsCounter, 1501 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1693 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-11 04:53:41,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1693 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2024-10-11 04:53:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2203. [2024-10-11 04:53:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 2201 states have (on average 1.5970013630168105) internal successors, (3515), 2202 states have internal predecessors, (3515), 0 states have call successors, (0), 0 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-11 04:53:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 3515 transitions. [2024-10-11 04:53:41,571 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 3515 transitions. Word has length 66 [2024-10-11 04:53:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:41,571 INFO L471 AbstractCegarLoop]: Abstraction has 2203 states and 3515 transitions. [2024-10-11 04:53:41,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-11 04:53:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 3515 transitions. [2024-10-11 04:53:41,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:41,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:41,572 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, 1, 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-11 04:53:41,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:53:41,572 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:41,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:41,573 INFO L85 PathProgramCache]: Analyzing trace with hash -866357393, now seen corresponding path program 1 times [2024-10-11 04:53:41,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:41,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793394322] [2024-10-11 04:53:41,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:41,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:41,611 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-11 04:53:41,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:41,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793394322] [2024-10-11 04:53:41,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793394322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:41,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:41,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:41,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829673580] [2024-10-11 04:53:41,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:41,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:41,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:41,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:41,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:41,614 INFO L87 Difference]: Start difference. First operand 2203 states and 3515 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-11 04:53:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:41,661 INFO L93 Difference]: Finished difference Result 3447 states and 5413 transitions. [2024-10-11 04:53:41,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:41,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-11 04:53:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:41,670 INFO L225 Difference]: With dead ends: 3447 [2024-10-11 04:53:41,670 INFO L226 Difference]: Without dead ends: 2793 [2024-10-11 04:53:41,672 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-11 04:53:41,675 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 1499 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1695 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-11 04:53:41,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1695 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2024-10-11 04:53:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2791. [2024-10-11 04:53:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2789 states have (on average 1.5743994263176766) internal successors, (4391), 2790 states have internal predecessors, (4391), 0 states have call successors, (0), 0 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-11 04:53:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 4391 transitions. [2024-10-11 04:53:41,726 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 4391 transitions. Word has length 66 [2024-10-11 04:53:41,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:41,726 INFO L471 AbstractCegarLoop]: Abstraction has 2791 states and 4391 transitions. [2024-10-11 04:53:41,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-11 04:53:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 4391 transitions. [2024-10-11 04:53:41,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:41,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:41,727 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, 1, 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-11 04:53:41,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:53:41,727 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:41,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:41,728 INFO L85 PathProgramCache]: Analyzing trace with hash 22376047, now seen corresponding path program 1 times [2024-10-11 04:53:41,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:41,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784294480] [2024-10-11 04:53:41,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:41,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:41,777 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-11 04:53:41,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:41,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784294480] [2024-10-11 04:53:41,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784294480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:41,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:41,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053156039] [2024-10-11 04:53:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:41,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:41,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:41,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:41,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:41,779 INFO L87 Difference]: Start difference. First operand 2791 states and 4391 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-11 04:53:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:41,834 INFO L93 Difference]: Finished difference Result 5147 states and 7929 transitions. [2024-10-11 04:53:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:41,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-11 04:53:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:41,845 INFO L225 Difference]: With dead ends: 5147 [2024-10-11 04:53:41,845 INFO L226 Difference]: Without dead ends: 3905 [2024-10-11 04:53:41,847 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-11 04:53:41,848 INFO L432 NwaCegarLoop]: 1598 mSDtfsCounter, 1497 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1697 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-11 04:53:41,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1697 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2024-10-11 04:53:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3903. [2024-10-11 04:53:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3903 states, 3901 states have (on average 1.5419123301717508) internal successors, (6015), 3902 states have internal predecessors, (6015), 0 states have call successors, (0), 0 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-11 04:53:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 6015 transitions. [2024-10-11 04:53:41,999 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 6015 transitions. Word has length 66 [2024-10-11 04:53:42,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:42,000 INFO L471 AbstractCegarLoop]: Abstraction has 3903 states and 6015 transitions. [2024-10-11 04:53:42,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-11 04:53:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 6015 transitions. [2024-10-11 04:53:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:42,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:42,000 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, 1, 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-11 04:53:42,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:53:42,001 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:42,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash -12062097, now seen corresponding path program 1 times [2024-10-11 04:53:42,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:42,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270451160] [2024-10-11 04:53:42,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:42,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:42,044 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-11 04:53:42,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:42,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270451160] [2024-10-11 04:53:42,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270451160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:42,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:42,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:42,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287335863] [2024-10-11 04:53:42,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:42,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:42,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:42,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:42,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:42,046 INFO L87 Difference]: Start difference. First operand 3903 states and 6015 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-11 04:53:42,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:42,123 INFO L93 Difference]: Finished difference Result 8355 states and 12577 transitions. [2024-10-11 04:53:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:42,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-10-11 04:53:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:42,150 INFO L225 Difference]: With dead ends: 8355 [2024-10-11 04:53:42,150 INFO L226 Difference]: Without dead ends: 6001 [2024-10-11 04:53:42,157 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-11 04:53:42,158 INFO L432 NwaCegarLoop]: 1614 mSDtfsCounter, 1505 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1697 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-11 04:53:42,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1697 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:42,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2024-10-11 04:53:42,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 5999. [2024-10-11 04:53:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5999 states, 5997 states have (on average 1.5019176254794064) internal successors, (9007), 5998 states have internal predecessors, (9007), 0 states have call successors, (0), 0 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-11 04:53:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5999 states to 5999 states and 9007 transitions. [2024-10-11 04:53:42,299 INFO L78 Accepts]: Start accepts. Automaton has 5999 states and 9007 transitions. Word has length 66 [2024-10-11 04:53:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:42,299 INFO L471 AbstractCegarLoop]: Abstraction has 5999 states and 9007 transitions. [2024-10-11 04:53:42,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-11 04:53:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 5999 states and 9007 transitions. [2024-10-11 04:53:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 04:53:42,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:42,300 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, 1, 1, 1, 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-11 04:53:42,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:53:42,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:42,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:42,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1491592148, now seen corresponding path program 1 times [2024-10-11 04:53:42,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:42,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187987484] [2024-10-11 04:53:42,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:42,343 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-11 04:53:42,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:42,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187987484] [2024-10-11 04:53:42,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187987484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:42,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:42,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:42,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089483295] [2024-10-11 04:53:42,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:42,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:42,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:42,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:42,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:42,347 INFO L87 Difference]: Start difference. First operand 5999 states and 9007 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:42,453 INFO L93 Difference]: Finished difference Result 10614 states and 15861 transitions. [2024-10-11 04:53:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:42,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-11 04:53:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:42,467 INFO L225 Difference]: With dead ends: 10614 [2024-10-11 04:53:42,467 INFO L226 Difference]: Without dead ends: 8115 [2024-10-11 04:53:42,472 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-11 04:53:42,473 INFO L432 NwaCegarLoop]: 1619 mSDtfsCounter, 1504 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1698 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-11 04:53:42,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1698 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8115 states. [2024-10-11 04:53:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8115 to 8113. [2024-10-11 04:53:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8113 states, 8111 states have (on average 1.485513500184934) internal successors, (12049), 8112 states have internal predecessors, (12049), 0 states have call successors, (0), 0 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-11 04:53:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8113 states to 8113 states and 12049 transitions. [2024-10-11 04:53:42,650 INFO L78 Accepts]: Start accepts. Automaton has 8113 states and 12049 transitions. Word has length 68 [2024-10-11 04:53:42,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:42,651 INFO L471 AbstractCegarLoop]: Abstraction has 8113 states and 12049 transitions. [2024-10-11 04:53:42,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 8113 states and 12049 transitions. [2024-10-11 04:53:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 04:53:42,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:42,652 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:53:42,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:53:42,652 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:42,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash 576573625, now seen corresponding path program 1 times [2024-10-11 04:53:42,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:42,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578895489] [2024-10-11 04:53:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 04:53:42,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:42,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578895489] [2024-10-11 04:53:42,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578895489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:42,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:42,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:53:42,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66598909] [2024-10-11 04:53:42,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:42,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:42,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:42,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:42,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:42,721 INFO L87 Difference]: Start difference. First operand 8113 states and 12049 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-11 04:53:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:45,571 INFO L93 Difference]: Finished difference Result 11119 states and 16976 transitions. [2024-10-11 04:53:45,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:45,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-11 04:53:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:45,584 INFO L225 Difference]: With dead ends: 11119 [2024-10-11 04:53:45,584 INFO L226 Difference]: Without dead ends: 9615 [2024-10-11 04:53:45,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:45,587 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 849 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:45,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 595 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:53:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9615 states. [2024-10-11 04:53:45,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9615 to 9615. [2024-10-11 04:53:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9615 states, 9613 states have (on average 1.4427337979818995) internal successors, (13869), 9614 states have internal predecessors, (13869), 0 states have call successors, (0), 0 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-11 04:53:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 13869 transitions. [2024-10-11 04:53:45,785 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 13869 transitions. Word has length 77 [2024-10-11 04:53:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:45,785 INFO L471 AbstractCegarLoop]: Abstraction has 9615 states and 13869 transitions. [2024-10-11 04:53:45,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-11 04:53:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 13869 transitions. [2024-10-11 04:53:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 04:53:45,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:45,787 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:53:45,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:53:45,787 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:45,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1608677359, now seen corresponding path program 1 times [2024-10-11 04:53:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:45,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879394137] [2024-10-11 04:53:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:45,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:45,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:53:45,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:45,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879394137] [2024-10-11 04:53:45,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879394137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:45,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:45,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:53:45,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741761675] [2024-10-11 04:53:45,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:45,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:45,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:45,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:45,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:45,853 INFO L87 Difference]: Start difference. First operand 9615 states and 13869 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:48,956 INFO L93 Difference]: Finished difference Result 15627 states and 22437 transitions. [2024-10-11 04:53:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:48,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-11 04:53:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:48,976 INFO L225 Difference]: With dead ends: 15627 [2024-10-11 04:53:48,976 INFO L226 Difference]: Without dead ends: 12621 [2024-10-11 04:53:48,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:48,983 INFO L432 NwaCegarLoop]: 696 mSDtfsCounter, 1039 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:48,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 703 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 04:53:48,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12621 states. [2024-10-11 04:53:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12621 to 12619. [2024-10-11 04:53:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12619 states, 12617 states have (on average 1.3925655861139732) internal successors, (17570), 12618 states have internal predecessors, (17570), 0 states have call successors, (0), 0 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-11 04:53:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12619 states to 12619 states and 17570 transitions. [2024-10-11 04:53:49,269 INFO L78 Accepts]: Start accepts. Automaton has 12619 states and 17570 transitions. Word has length 81 [2024-10-11 04:53:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:49,270 INFO L471 AbstractCegarLoop]: Abstraction has 12619 states and 17570 transitions. [2024-10-11 04:53:49,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 12619 states and 17570 transitions. [2024-10-11 04:53:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:53:49,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:49,272 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:53:49,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:53:49,273 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:49,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:49,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1535692104, now seen corresponding path program 1 times [2024-10-11 04:53:49,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:49,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309261371] [2024-10-11 04:53:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:49,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 04:53:49,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:49,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309261371] [2024-10-11 04:53:49,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309261371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:49,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:49,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:49,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526201525] [2024-10-11 04:53:49,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:49,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:49,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:49,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:49,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:49,449 INFO L87 Difference]: Start difference. First operand 12619 states and 17570 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:50,172 INFO L93 Difference]: Finished difference Result 53337 states and 76681 transitions. [2024-10-11 04:53:50,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:50,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 04:53:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:50,234 INFO L225 Difference]: With dead ends: 53337 [2024-10-11 04:53:50,234 INFO L226 Difference]: Without dead ends: 46775 [2024-10-11 04:53:50,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:53:50,255 INFO L432 NwaCegarLoop]: 1634 mSDtfsCounter, 8090 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8090 SdHoareTripleChecker+Valid, 3839 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:50,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8090 Valid, 3839 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46775 states. [2024-10-11 04:53:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46775 to 19179. [2024-10-11 04:53:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19179 states, 19177 states have (on average 1.408458048704177) internal successors, (27010), 19178 states have internal predecessors, (27010), 0 states have call successors, (0), 0 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-11 04:53:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19179 states to 19179 states and 27010 transitions. [2024-10-11 04:53:50,733 INFO L78 Accepts]: Start accepts. Automaton has 19179 states and 27010 transitions. Word has length 86 [2024-10-11 04:53:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:50,733 INFO L471 AbstractCegarLoop]: Abstraction has 19179 states and 27010 transitions. [2024-10-11 04:53:50,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 19179 states and 27010 transitions. [2024-10-11 04:53:50,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:53:50,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:50,736 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:53:50,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:53:50,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:50,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:50,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1575636040, now seen corresponding path program 1 times [2024-10-11 04:53:50,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:50,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870756406] [2024-10-11 04:53:50,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 04:53:50,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:50,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870756406] [2024-10-11 04:53:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870756406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:50,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:50,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326305697] [2024-10-11 04:53:50,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:50,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:50,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:50,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:50,918 INFO L87 Difference]: Start difference. First operand 19179 states and 27010 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:51,771 INFO L93 Difference]: Finished difference Result 59897 states and 86121 transitions. [2024-10-11 04:53:51,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:51,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 04:53:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:51,848 INFO L225 Difference]: With dead ends: 59897 [2024-10-11 04:53:51,848 INFO L226 Difference]: Without dead ends: 53335 [2024-10-11 04:53:51,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:53:51,875 INFO L432 NwaCegarLoop]: 1631 mSDtfsCounter, 8138 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8138 SdHoareTripleChecker+Valid, 3766 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:51,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8138 Valid, 3766 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53335 states. [2024-10-11 04:53:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53335 to 29035. [2024-10-11 04:53:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29035 states, 29033 states have (on average 1.4152860538008474) internal successors, (41090), 29034 states have internal predecessors, (41090), 0 states have call successors, (0), 0 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-11 04:53:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29035 states to 29035 states and 41090 transitions. [2024-10-11 04:53:52,593 INFO L78 Accepts]: Start accepts. Automaton has 29035 states and 41090 transitions. Word has length 86 [2024-10-11 04:53:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:52,593 INFO L471 AbstractCegarLoop]: Abstraction has 29035 states and 41090 transitions. [2024-10-11 04:53:52,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 29035 states and 41090 transitions. [2024-10-11 04:53:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:53:52,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:52,596 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:53:52,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:53:52,596 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:52,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:52,596 INFO L85 PathProgramCache]: Analyzing trace with hash 949979976, now seen corresponding path program 1 times [2024-10-11 04:53:52,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:52,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5146894] [2024-10-11 04:53:52,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:52,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 04:53:52,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:52,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5146894] [2024-10-11 04:53:52,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5146894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:52,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:52,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639487123] [2024-10-11 04:53:52,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:52,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:52,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:52,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:52,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:52,723 INFO L87 Difference]: Start difference. First operand 29035 states and 41090 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:53,943 INFO L93 Difference]: Finished difference Result 66457 states and 95561 transitions. [2024-10-11 04:53:53,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:53,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 04:53:53,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:54,023 INFO L225 Difference]: With dead ends: 66457 [2024-10-11 04:53:54,024 INFO L226 Difference]: Without dead ends: 59895 [2024-10-11 04:53:54,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:53:54,044 INFO L432 NwaCegarLoop]: 1628 mSDtfsCounter, 8183 mSDsluCounter, 2161 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8183 SdHoareTripleChecker+Valid, 3789 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:54,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8183 Valid, 3789 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:54,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59895 states. [2024-10-11 04:53:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59895 to 35595. [2024-10-11 04:53:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35595 states, 35593 states have (on average 1.4196611693310481) internal successors, (50530), 35594 states have internal predecessors, (50530), 0 states have call successors, (0), 0 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-11 04:53:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35595 states to 35595 states and 50530 transitions. [2024-10-11 04:53:55,137 INFO L78 Accepts]: Start accepts. Automaton has 35595 states and 50530 transitions. Word has length 86 [2024-10-11 04:53:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:55,137 INFO L471 AbstractCegarLoop]: Abstraction has 35595 states and 50530 transitions. [2024-10-11 04:53:55,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 35595 states and 50530 transitions. [2024-10-11 04:53:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:53:55,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:55,140 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:53:55,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:53:55,140 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:55,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1838713416, now seen corresponding path program 1 times [2024-10-11 04:53:55,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:55,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608373222] [2024-10-11 04:53:55,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:55,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 04:53:55,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:55,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608373222] [2024-10-11 04:53:55,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608373222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:55,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:55,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:55,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395686261] [2024-10-11 04:53:55,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:55,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:55,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:55,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:55,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:55,332 INFO L87 Difference]: Start difference. First operand 35595 states and 50530 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-11 04:53:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:57,021 INFO L93 Difference]: Finished difference Result 73017 states and 105001 transitions. [2024-10-11 04:53:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:57,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 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 86 [2024-10-11 04:53:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:57,109 INFO L225 Difference]: With dead ends: 73017 [2024-10-11 04:53:57,109 INFO L226 Difference]: Without dead ends: 66455 [2024-10-11 04:53:57,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:53:57,127 INFO L432 NwaCegarLoop]: 1633 mSDtfsCounter, 8090 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8090 SdHoareTripleChecker+Valid, 3876 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:57,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8090 Valid, 3876 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:53:57,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66455 states. [2024-10-11 04:53:58,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66455 to 42155. [2024-10-11 04:53:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42155 states, 42153 states have (on average 1.4226745427371716) internal successors, (59970), 42154 states have internal predecessors, (59970), 0 states have call successors, (0), 0 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-11 04:53:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42155 states to 42155 states and 59970 transitions. [2024-10-11 04:53:58,341 INFO L78 Accepts]: Start accepts. Automaton has 42155 states and 59970 transitions. Word has length 86 [2024-10-11 04:53:58,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:58,342 INFO L471 AbstractCegarLoop]: Abstraction has 42155 states and 59970 transitions. [2024-10-11 04:53:58,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-11 04:53:58,342 INFO L276 IsEmpty]: Start isEmpty. Operand 42155 states and 59970 transitions. [2024-10-11 04:53:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:53:58,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:58,345 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:53:58,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 04:53:58,345 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:58,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:58,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1804275272, now seen corresponding path program 1 times [2024-10-11 04:53:58,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:58,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884669635] [2024-10-11 04:53:58,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:58,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 04:53:58,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:58,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884669635] [2024-10-11 04:53:58,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884669635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:58,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:58,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:58,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559746534] [2024-10-11 04:53:58,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:58,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:58,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:58,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:58,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:58,523 INFO L87 Difference]: Start difference. First operand 42155 states and 59970 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:59,994 INFO L93 Difference]: Finished difference Result 79577 states and 114441 transitions. [2024-10-11 04:53:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:59,995 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 04:53:59,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:00,086 INFO L225 Difference]: With dead ends: 79577 [2024-10-11 04:54:00,087 INFO L226 Difference]: Without dead ends: 73015 [2024-10-11 04:54:00,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:54:00,105 INFO L432 NwaCegarLoop]: 1634 mSDtfsCounter, 8030 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8030 SdHoareTripleChecker+Valid, 4006 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:00,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8030 Valid, 4006 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:54:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73015 states. [2024-10-11 04:54:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73015 to 48715. [2024-10-11 04:54:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48715 states, 48713 states have (on average 1.4248763163837168) internal successors, (69410), 48714 states have internal predecessors, (69410), 0 states have call successors, (0), 0 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-11 04:54:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48715 states to 48715 states and 69410 transitions. [2024-10-11 04:54:01,604 INFO L78 Accepts]: Start accepts. Automaton has 48715 states and 69410 transitions. Word has length 86 [2024-10-11 04:54:01,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:01,605 INFO L471 AbstractCegarLoop]: Abstraction has 48715 states and 69410 transitions. [2024-10-11 04:54:01,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 48715 states and 69410 transitions. [2024-10-11 04:54:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 04:54:01,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:01,609 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:01,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 04:54:01,610 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:01,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:01,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1799324112, now seen corresponding path program 1 times [2024-10-11 04:54:01,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:01,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114094149] [2024-10-11 04:54:01,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:01,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:01,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:01,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114094149] [2024-10-11 04:54:01,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114094149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:01,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:01,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:54:01,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975588601] [2024-10-11 04:54:01,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:01,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:54:01,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:01,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:54:01,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:54:01,750 INFO L87 Difference]: Start difference. First operand 48715 states and 69410 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-11 04:54:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:02,878 INFO L93 Difference]: Finished difference Result 78692 states and 113114 transitions. [2024-10-11 04:54:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:54:02,886 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 88 [2024-10-11 04:54:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:02,942 INFO L225 Difference]: With dead ends: 78692 [2024-10-11 04:54:02,942 INFO L226 Difference]: Without dead ends: 36034 [2024-10-11 04:54:02,962 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-11 04:54:02,963 INFO L432 NwaCegarLoop]: 1607 mSDtfsCounter, 58 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3152 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:02,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3152 Invalid, 10 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:54:02,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36034 states. [2024-10-11 04:54:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36034 to 36032. [2024-10-11 04:54:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36032 states, 36030 states have (on average 1.4243408270885374) internal successors, (51319), 36031 states have internal predecessors, (51319), 0 states have call successors, (0), 0 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-11 04:54:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36032 states to 36032 states and 51319 transitions. [2024-10-11 04:54:03,776 INFO L78 Accepts]: Start accepts. Automaton has 36032 states and 51319 transitions. Word has length 88 [2024-10-11 04:54:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:03,779 INFO L471 AbstractCegarLoop]: Abstraction has 36032 states and 51319 transitions. [2024-10-11 04:54:03,779 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-11 04:54:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 36032 states and 51319 transitions. [2024-10-11 04:54:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 04:54:03,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:03,781 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:03,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 04:54:03,782 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:03,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1059885715, now seen corresponding path program 1 times [2024-10-11 04:54:03,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:03,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962901025] [2024-10-11 04:54:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:03,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:54:03,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:03,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962901025] [2024-10-11 04:54:03,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962901025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:03,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:03,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:54:03,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996020283] [2024-10-11 04:54:03,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:03,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:54:03,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:03,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:54:03,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:54:03,901 INFO L87 Difference]: Start difference. First operand 36032 states and 51319 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:05,286 INFO L93 Difference]: Finished difference Result 63694 states and 91646 transitions. [2024-10-11 04:54:05,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:54:05,286 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-10-11 04:54:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:05,367 INFO L225 Difference]: With dead ends: 63694 [2024-10-11 04:54:05,368 INFO L226 Difference]: Without dead ends: 59084 [2024-10-11 04:54:05,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:54:05,387 INFO L432 NwaCegarLoop]: 1625 mSDtfsCounter, 8038 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8038 SdHoareTripleChecker+Valid, 3966 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:05,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8038 Valid, 3966 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:54:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59084 states. [2024-10-11 04:54:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59084 to 40640. [2024-10-11 04:54:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40640 states, 40638 states have (on average 1.426620404547468) internal successors, (57975), 40639 states have internal predecessors, (57975), 0 states have call successors, (0), 0 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-11 04:54:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40640 states to 40640 states and 57975 transitions. [2024-10-11 04:54:06,569 INFO L78 Accepts]: Start accepts. Automaton has 40640 states and 57975 transitions. Word has length 88 [2024-10-11 04:54:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:06,569 INFO L471 AbstractCegarLoop]: Abstraction has 40640 states and 57975 transitions. [2024-10-11 04:54:06,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 40640 states and 57975 transitions. [2024-10-11 04:54:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 04:54:06,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:06,572 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:06,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 04:54:06,572 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:06,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:06,572 INFO L85 PathProgramCache]: Analyzing trace with hash -192668114, now seen corresponding path program 1 times [2024-10-11 04:54:06,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:06,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987935268] [2024-10-11 04:54:06,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:06,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:06,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:06,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987935268] [2024-10-11 04:54:06,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987935268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:06,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:06,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:54:06,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77744290] [2024-10-11 04:54:06,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:06,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:54:06,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:06,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:54:06,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:54:06,639 INFO L87 Difference]: Start difference. First operand 40640 states and 57975 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-11 04:54:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:07,142 INFO L93 Difference]: Finished difference Result 57924 states and 82937 transitions. [2024-10-11 04:54:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:54:07,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-11 04:54:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:07,175 INFO L225 Difference]: With dead ends: 57924 [2024-10-11 04:54:07,175 INFO L226 Difference]: Without dead ends: 23362 [2024-10-11 04:54:07,200 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-11 04:54:07,201 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 53 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3137 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-11 04:54:07,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:54:07,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23362 states. [2024-10-11 04:54:07,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23362 to 23360. [2024-10-11 04:54:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23360 states, 23358 states have (on average 1.403159517081942) internal successors, (32775), 23359 states have internal predecessors, (32775), 0 states have call successors, (0), 0 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-11 04:54:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23360 states to 23360 states and 32775 transitions. [2024-10-11 04:54:07,794 INFO L78 Accepts]: Start accepts. Automaton has 23360 states and 32775 transitions. Word has length 89 [2024-10-11 04:54:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:07,795 INFO L471 AbstractCegarLoop]: Abstraction has 23360 states and 32775 transitions. [2024-10-11 04:54:07,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-11 04:54:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 23360 states and 32775 transitions. [2024-10-11 04:54:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:54:07,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:07,797 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:07,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 04:54:07,797 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:07,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash -251569188, now seen corresponding path program 1 times [2024-10-11 04:54:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:07,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869542632] [2024-10-11 04:54:07,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:07,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:07,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:07,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869542632] [2024-10-11 04:54:07,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869542632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:07,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:07,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:54:07,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166084429] [2024-10-11 04:54:07,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:07,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:54:07,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:07,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:54:07,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:54:07,864 INFO L87 Difference]: Start difference. First operand 23360 states and 32775 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:08,065 INFO L93 Difference]: Finished difference Result 32004 states and 45137 transitions. [2024-10-11 04:54:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:54:08,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 04:54:08,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:08,084 INFO L225 Difference]: With dead ends: 32004 [2024-10-11 04:54:08,085 INFO L226 Difference]: Without dead ends: 14722 [2024-10-11 04:54:08,098 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-11 04:54:08,099 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 50 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3122 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-11 04:54:08,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3122 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:54:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14722 states. [2024-10-11 04:54:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14722 to 14720. [2024-10-11 04:54:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14720 states, 14718 states have (on average 1.3789237668161436) internal successors, (20295), 14719 states have internal predecessors, (20295), 0 states have call successors, (0), 0 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-11 04:54:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14720 states to 14720 states and 20295 transitions. [2024-10-11 04:54:08,359 INFO L78 Accepts]: Start accepts. Automaton has 14720 states and 20295 transitions. Word has length 91 [2024-10-11 04:54:08,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:08,359 INFO L471 AbstractCegarLoop]: Abstraction has 14720 states and 20295 transitions. [2024-10-11 04:54:08,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 14720 states and 20295 transitions. [2024-10-11 04:54:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 04:54:08,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:08,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:54:08,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 04:54:08,361 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:08,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1008841974, now seen corresponding path program 1 times [2024-10-11 04:54:08,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:08,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130382317] [2024-10-11 04:54:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:08,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:08,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130382317] [2024-10-11 04:54:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130382317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:08,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:08,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:54:08,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640656628] [2024-10-11 04:54:08,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:08,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:54:08,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:08,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:54:08,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:54:08,522 INFO L87 Difference]: Start difference. First operand 14720 states and 20295 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:08,708 INFO L93 Difference]: Finished difference Result 19044 states and 26417 transitions. [2024-10-11 04:54:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:54:08,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 04:54:08,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:08,723 INFO L225 Difference]: With dead ends: 19044 [2024-10-11 04:54:08,723 INFO L226 Difference]: Without dead ends: 10402 [2024-10-11 04:54:08,731 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-11 04:54:08,732 INFO L432 NwaCegarLoop]: 1586 mSDtfsCounter, 47 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3107 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-11 04:54:08,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3107 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:54:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10402 states. [2024-10-11 04:54:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10402 to 10400. [2024-10-11 04:54:08,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10400 states, 10398 states have (on average 1.357472590882862) internal successors, (14115), 10399 states have internal predecessors, (14115), 0 states have call successors, (0), 0 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-11 04:54:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10400 states to 10400 states and 14115 transitions. [2024-10-11 04:54:09,001 INFO L78 Accepts]: Start accepts. Automaton has 10400 states and 14115 transitions. Word has length 93 [2024-10-11 04:54:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:09,002 INFO L471 AbstractCegarLoop]: Abstraction has 10400 states and 14115 transitions. [2024-10-11 04:54:09,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 10400 states and 14115 transitions. [2024-10-11 04:54:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 04:54:09,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:09,004 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:09,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 04:54:09,004 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:09,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:09,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2134258760, now seen corresponding path program 1 times [2024-10-11 04:54:09,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:09,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598699362] [2024-10-11 04:54:09,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:09,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:09,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:09,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598699362] [2024-10-11 04:54:09,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598699362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:09,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:09,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:54:09,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359014185] [2024-10-11 04:54:09,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:09,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:54:09,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:09,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:54:09,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:54:09,107 INFO L87 Difference]: Start difference. First operand 10400 states and 14115 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:09,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:09,216 INFO L93 Difference]: Finished difference Result 12564 states and 17147 transitions. [2024-10-11 04:54:09,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:54:09,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-10-11 04:54:09,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:09,227 INFO L225 Difference]: With dead ends: 12564 [2024-10-11 04:54:09,227 INFO L226 Difference]: Without dead ends: 8242 [2024-10-11 04:54:09,232 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-11 04:54:09,233 INFO L432 NwaCegarLoop]: 1579 mSDtfsCounter, 44 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3092 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-11 04:54:09,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3092 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:54:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8242 states. [2024-10-11 04:54:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8242 to 8240. [2024-10-11 04:54:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8240 states, 8238 states have (on average 1.3419519300801166) internal successors, (11055), 8239 states have internal predecessors, (11055), 0 states have call successors, (0), 0 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-11 04:54:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 11055 transitions. [2024-10-11 04:54:09,393 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 11055 transitions. Word has length 95 [2024-10-11 04:54:09,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:09,394 INFO L471 AbstractCegarLoop]: Abstraction has 8240 states and 11055 transitions. [2024-10-11 04:54:09,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 11055 transitions. [2024-10-11 04:54:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 04:54:09,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:09,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:09,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 04:54:09,396 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:09,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:09,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1081426458, now seen corresponding path program 1 times [2024-10-11 04:54:09,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:09,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486306851] [2024-10-11 04:54:09,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:09,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486306851] [2024-10-11 04:54:09,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486306851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:09,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:09,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:54:09,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681921669] [2024-10-11 04:54:09,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:09,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:54:09,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:09,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:54:09,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:54:09,491 INFO L87 Difference]: Start difference. First operand 8240 states and 11055 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:09,566 INFO L93 Difference]: Finished difference Result 9324 states and 12557 transitions. [2024-10-11 04:54:09,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:54:09,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-11 04:54:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:09,575 INFO L225 Difference]: With dead ends: 9324 [2024-10-11 04:54:09,576 INFO L226 Difference]: Without dead ends: 7162 [2024-10-11 04:54:09,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-11 04:54:09,580 INFO L432 NwaCegarLoop]: 1572 mSDtfsCounter, 41 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3077 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-11 04:54:09,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3077 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:54:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7162 states. [2024-10-11 04:54:09,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7162 to 7160. [2024-10-11 04:54:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7160 states, 7158 states have (on average 1.3327745180217938) internal successors, (9540), 7159 states have internal predecessors, (9540), 0 states have call successors, (0), 0 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-11 04:54:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7160 states to 7160 states and 9540 transitions. [2024-10-11 04:54:09,698 INFO L78 Accepts]: Start accepts. Automaton has 7160 states and 9540 transitions. Word has length 97 [2024-10-11 04:54:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:09,698 INFO L471 AbstractCegarLoop]: Abstraction has 7160 states and 9540 transitions. [2024-10-11 04:54:09,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 7160 states and 9540 transitions. [2024-10-11 04:54:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 04:54:09,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:09,699 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:54:09,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 04:54:09,700 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:09,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:09,700 INFO L85 PathProgramCache]: Analyzing trace with hash -905969260, now seen corresponding path program 1 times [2024-10-11 04:54:09,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:09,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207168242] [2024-10-11 04:54:09,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:09,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:10,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:10,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207168242] [2024-10-11 04:54:10,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207168242] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:54:10,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841754674] [2024-10-11 04:54:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:10,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:54:10,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:54:10,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:54:10,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:54:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:10,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 04:54:10,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:54:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:10,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:54:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:11,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841754674] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:54:11,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:54:11,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-10-11 04:54:11,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350290707] [2024-10-11 04:54:11,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:54:11,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 04:54:11,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 04:54:11,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2024-10-11 04:54:11,622 INFO L87 Difference]: Start difference. First operand 7160 states and 9540 transitions. Second operand has 25 states, 25 states have (on average 10.8) internal successors, (270), 24 states have internal predecessors, (270), 0 states have call successors, (0), 0 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-11 04:54:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:13,089 INFO L93 Difference]: Finished difference Result 11674 states and 15757 transitions. [2024-10-11 04:54:13,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 04:54:13,090 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.8) internal successors, (270), 24 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-11 04:54:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:13,102 INFO L225 Difference]: With dead ends: 11674 [2024-10-11 04:54:13,102 INFO L226 Difference]: Without dead ends: 10592 [2024-10-11 04:54:13,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=588, Invalid=2274, Unknown=0, NotChecked=0, Total=2862 [2024-10-11 04:54:13,106 INFO L432 NwaCegarLoop]: 1507 mSDtfsCounter, 22330 mSDsluCounter, 6493 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22330 SdHoareTripleChecker+Valid, 8000 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:13,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22330 Valid, 8000 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 04:54:13,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10592 states. [2024-10-11 04:54:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10592 to 10520. [2024-10-11 04:54:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10520 states, 10518 states have (on average 1.336280661722761) internal successors, (14055), 10519 states have internal predecessors, (14055), 0 states have call successors, (0), 0 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-11 04:54:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10520 states to 10520 states and 14055 transitions. [2024-10-11 04:54:13,377 INFO L78 Accepts]: Start accepts. Automaton has 10520 states and 14055 transitions. Word has length 99 [2024-10-11 04:54:13,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:13,377 INFO L471 AbstractCegarLoop]: Abstraction has 10520 states and 14055 transitions. [2024-10-11 04:54:13,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.8) internal successors, (270), 24 states have internal predecessors, (270), 0 states have call successors, (0), 0 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-11 04:54:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 10520 states and 14055 transitions. [2024-10-11 04:54:13,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:54:13,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:13,378 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:13,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 04:54:13,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 04:54:13,579 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:13,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:13,579 INFO L85 PathProgramCache]: Analyzing trace with hash 472492477, now seen corresponding path program 1 times [2024-10-11 04:54:13,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:13,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145110509] [2024-10-11 04:54:13,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:13,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:14,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:14,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145110509] [2024-10-11 04:54:14,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145110509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:54:14,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762492456] [2024-10-11 04:54:14,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:14,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:54:14,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:54:14,505 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:54:14,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:54:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:14,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 04:54:14,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:54:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:14,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:54:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:15,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762492456] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:54:15,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:54:15,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-10-11 04:54:15,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868413493] [2024-10-11 04:54:15,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:54:15,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 04:54:15,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:15,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 04:54:15,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2024-10-11 04:54:15,635 INFO L87 Difference]: Start difference. First operand 10520 states and 14055 transitions. Second operand has 26 states, 26 states have (on average 9.807692307692308) internal successors, (255), 25 states have internal predecessors, (255), 0 states have call successors, (0), 0 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-11 04:54:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:16,297 INFO L93 Difference]: Finished difference Result 19766 states and 26598 transitions. [2024-10-11 04:54:16,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:54:16,297 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.807692307692308) internal successors, (255), 25 states have internal predecessors, (255), 0 states have call successors, (0), 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 100 [2024-10-11 04:54:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:16,316 INFO L225 Difference]: With dead ends: 19766 [2024-10-11 04:54:16,317 INFO L226 Difference]: Without dead ends: 15324 [2024-10-11 04:54:16,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 04:54:16,324 INFO L432 NwaCegarLoop]: 1521 mSDtfsCounter, 16474 mSDsluCounter, 4895 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16474 SdHoareTripleChecker+Valid, 6416 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:16,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16474 Valid, 6416 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 04:54:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15324 states. [2024-10-11 04:54:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15324 to 15200. [2024-10-11 04:54:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15200 states, 15198 states have (on average 1.3314251875246743) internal successors, (20235), 15199 states have internal predecessors, (20235), 0 states have call successors, (0), 0 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-11 04:54:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15200 states to 15200 states and 20235 transitions. [2024-10-11 04:54:16,624 INFO L78 Accepts]: Start accepts. Automaton has 15200 states and 20235 transitions. Word has length 100 [2024-10-11 04:54:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:16,624 INFO L471 AbstractCegarLoop]: Abstraction has 15200 states and 20235 transitions. [2024-10-11 04:54:16,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.807692307692308) internal successors, (255), 25 states have internal predecessors, (255), 0 states have call successors, (0), 0 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-11 04:54:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 15200 states and 20235 transitions. [2024-10-11 04:54:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:54:16,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:16,626 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:16,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 04:54:16,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 04:54:16,831 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:16,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:16,832 INFO L85 PathProgramCache]: Analyzing trace with hash 391414082, now seen corresponding path program 1 times [2024-10-11 04:54:16,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:16,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676898912] [2024-10-11 04:54:16,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:16,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:17,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676898912] [2024-10-11 04:54:17,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676898912] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:54:17,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529200786] [2024-10-11 04:54:17,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:17,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:54:17,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:54:17,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:54:17,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 04:54:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:17,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:54:17,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:54:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:18,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:54:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:19,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529200786] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:54:19,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:54:19,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2024-10-11 04:54:19,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763037614] [2024-10-11 04:54:19,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:54:19,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 04:54:19,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:19,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 04:54:19,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2024-10-11 04:54:19,043 INFO L87 Difference]: Start difference. First operand 15200 states and 20235 transitions. Second operand has 29 states, 29 states have (on average 9.689655172413794) internal successors, (281), 28 states have internal predecessors, (281), 0 states have call successors, (0), 0 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-11 04:54:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:23,785 INFO L93 Difference]: Finished difference Result 60574 states and 81322 transitions. [2024-10-11 04:54:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-11 04:54:23,785 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.689655172413794) internal successors, (281), 28 states have internal predecessors, (281), 0 states have call successors, (0), 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-11 04:54:23,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:23,853 INFO L225 Difference]: With dead ends: 60574 [2024-10-11 04:54:23,853 INFO L226 Difference]: Without dead ends: 51452 [2024-10-11 04:54:23,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1084, Invalid=4028, Unknown=0, NotChecked=0, Total=5112 [2024-10-11 04:54:23,880 INFO L432 NwaCegarLoop]: 1549 mSDtfsCounter, 26856 mSDsluCounter, 5509 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26856 SdHoareTripleChecker+Valid, 7058 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:23,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26856 Valid, 7058 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:54:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51452 states. [2024-10-11 04:54:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51452 to 50720. [2024-10-11 04:54:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50720 states, 50718 states have (on average 1.3110729918372175) internal successors, (66495), 50719 states have internal predecessors, (66495), 0 states have call successors, (0), 0 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-11 04:54:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50720 states to 50720 states and 66495 transitions. [2024-10-11 04:54:25,394 INFO L78 Accepts]: Start accepts. Automaton has 50720 states and 66495 transitions. Word has length 101 [2024-10-11 04:54:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:25,395 INFO L471 AbstractCegarLoop]: Abstraction has 50720 states and 66495 transitions. [2024-10-11 04:54:25,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.689655172413794) internal successors, (281), 28 states have internal predecessors, (281), 0 states have call successors, (0), 0 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-11 04:54:25,395 INFO L276 IsEmpty]: Start isEmpty. Operand 50720 states and 66495 transitions. [2024-10-11 04:54:25,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 04:54:25,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:25,400 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:54:25,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 04:54:25,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:54:25,601 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:25,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash -247064782, now seen corresponding path program 1 times [2024-10-11 04:54:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285026429] [2024-10-11 04:54:25,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:25,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:25,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285026429] [2024-10-11 04:54:25,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285026429] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:54:25,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162634111] [2024-10-11 04:54:25,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:25,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:54:25,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:54:25,915 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:54:25,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process